Search Results for ""

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

A Keith number is an n-digit integer N>9 such that if a Fibonacci-like sequence (in which each term in the sequence is the sum of the n previous terms) is formed with the ...

The base-26 number system composed of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 and the letters A-P.

The base of a number system, i.e., 2 for binary, 8 for octal, 10 for decimal, and 16 for hexadecimal. The radix is sometimes called the base or scale.

A polygonal number of the form O_n=n(3n-2). The first few are 1, 8, 21, 40, 65, 96, 133, 176, ... (OEIS A000567). The generating function for the octagonal numbers is ...

A polygonal number of the form n(5n-3)/2. The first few are 1, 7, 18, 34, 55, 81, 112, ... (OEIS A000566). The generating function for the heptagonal numbers is ...

A number of the form 2^n-1 obtained by setting x=1 in a Fermat-Lucas polynomial, more commonly known as a Mersenne number.

A figurate number which is equal to the cubic number n^3. The first few are 1, 8, 27, 64, ... (OEIS A000578).

136·2^(256) approx 1.575×10^(79). According to Eddington, the exact number of protons in the universe, where 136 was the reciprocal of the fine structure constant as best as ...

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...