Search Results for ""

A Woodall number is a number of the form W_n=2^nn-1. Woodall numbers are therefore similar to Mersenne numbers 2^n-1 but with an additional factor of n multiplying the power ...

There are two completely different definitions of Cayley numbers. The first and most commonly encountered type of Cayley number is the eight elements in a Cayley algebra, ...

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

A polygonal number of the form n(3n-1)/2. The first few are 1, 5, 12, 22, 35, 51, 70, ... (OEIS A000326). The generating function for the pentagonal numbers is ...

A Poulet number is a Fermat pseudoprime to base 2, denoted psp(2), i.e., a composite number n such that 2^(n-1)=1 (mod n). The first few Poulet numbers are 341, 561, 645, ...

A Euclidean number is a number which can be obtained by repeatedly solving the quadratic equation. Euclidean numbers, together with the rational numbers, can be constructed ...

A Stoneham number is a number alpha_(b,c) of the form alpha_(b,c)=sum_(k=1)^infty1/(b^(c^k)c^k), where b,c>1 are relatively prime positive integers. Stoneham (1973) proved ...

A number with a continued fraction whose terms are the values of one or more polynomials evaluated on consecutive integers and then interleaved. This property is preserved by ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

The number of alternating permutations for n elements is sometimes called an Euler zigzag number. Denote the number of alternating permutations on n elements for which the ...