Search Results for ""
651 - 660 of 4110 for Whole numbers and IntegersSearch Results
1 0 1 0 1 1 0 1 2 2 0 2 4 5 5 (1) The Entringer numbers E(n,k) (OEIS A008281) are the number of permutations of {1,2,...,n+1}, starting with k+1, which, after initially ...
The Euler numbers, also called the secant numbers or zig numbers, are defined for |x|<pi/2 by sechx-1=-(E_1^*x^2)/(2!)+(E_2^*x^4)/(4!)-(E_3^*x^6)/(6!)+... (1) ...
The Fibonacci Q-matrix is the matrix defined by Q=[F_2 F_1; F_1 F_0]=[1 1; 1 0], (1) where F_n is a Fibonacci number. Then Q^n=[F_(n+1) F_n; F_n F_(n-1)] (2) (Honsberger ...
A prime number is said to be weakly prime if changing a single digit to every other possible digit produces a composite number when performed on each digit. The first few ...
The abundance of a number n, sometimes also called the abundancy (a term which in this work, is reserved for a different but related quantity), is the quantity ...
A Fermat prime is a Fermat number F_n=2^(2^n)+1 that is prime. Fermat primes are therefore near-square primes. Fermat conjectured in 1650 that every Fermat number is prime ...
By way of analogy with the eban numbers, iban numbers are defined as numbers whose English names do not contain the letter "i" (i.e., "i" is banned). The first few are 1, 2, ...
By way of analogy with the eban numbers, oban numbers are defined as numbers whose English names do not contain the letter "o" (i.e., "o" is banned). Note that this ...
Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...
An Euler number prime is an Euler number E_n such that the absolute value |E_n| is prime (the absolute value is needed since E_n takes on alternating positive and negative ...
...
View search results from all Wolfram sites (71114 matches)

