Search Results for ""

A sequence whose terms are integers. The most complete printed references for such sequences are Sloane (1973) and its update, Sloane and Plouffe (1995). Neil Sloane ...

Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers E_n = 1+product_(i=1)^(n)p_i (1) = 1+p_n#, (2) ...

The quantity twelve (12) is sometimes known as a dozen. It is in turn one twelfth of a gross. Base-12 is known as duodecimal. The Schoolhouse Rock segment "Little Twelvetoes" ...

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

The nth central fibonomial coefficient is defined as [2n; n]_F = product_(k=1)^(n)(F_(n+k))/(F_k) (1) = ...

A factorion is an integer which is equal to the sum of factorials of its digits. There are exactly four such numbers: 1 = 1! (1) 2 = 2! (2) 145 = 1!+4!+5! (3) 40585 = ...

Let psi = 1+phi (1) = 1/2(3+sqrt(5)) (2) = 2.618033... (3) (OEIS A104457), where phi is the golden ratio, and alpha = lnphi (4) = 0.4812118 (5) (OEIS A002390). Define the ...

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

In French and German usage, one milliard equals 10^9=1000000000. American usage does not have a number called the milliard, instead using the term billion to denote 10^9. ...

A triangle with rows containing the numbers {1,2,...,n} that begins with 1, ends with n, and such that the sum of each two consecutive entries being a prime. Rows 2 to 6 are ...