Search Results for ""

The Eulerian number <n; k> gives the number of permutations of {1,2,...,n} having k permutation ascents (Graham et al. 1994, p. 267). Note that a slightly different ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

Surreal numbers are the most natural collection of numbers which includes both the real numbers and the infinite ordinal numbers of Georg Cantor. They were invented by John ...

Write down the positive integers in row one, cross out every k_1th number, and write the partial sums of the remaining numbers in the row below. Now cross off every k_2th ...

A pentagonal square triangular number is a number that is simultaneously a pentagonal number P_l, a square number S_m, and a triangular number T_n. This requires a solution ...

A number which can be represented by a finite number of additions, subtractions, multiplications, divisions, and finite square root extractions of integers. Such numbers ...

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

A slightly archaic term for a computer-generated random number. The prefix pseudo- is used to distinguish this type of number from a "truly" random number generated by a ...

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.