Search Results for ""

A Sierpiński number of the first kind is a number of the form S_n=n^n+1. The first few are 2, 5, 28, 257, 3126, 46657, 823544, 16777217, ... (OEIS A014566). Sierpiński proved ...

Successive points dividing a golden rectangle into squares lie on a logarithmic spiral (Wells 1991, p. 39; Livio 2002, p. 119) which is sometimes known as the golden spiral. ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

A double Mersenne number is a number of the form M_(M_n)=2^(2^n-1)-1, where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, ...

The smallest nontrivial taxicab number, i.e., the smallest number representable in two ways as a sum of two cubes. It is given by 1729=1^3+12^3=9^3+10^3. The number derives ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

A number which is simultaneously square and triangular. Let T_n denote the nth triangular number and S_m the mth square number, then a number which is both triangular and ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...

The nth Smarandache-Wellin number is formed from the consecutive number sequence obtained by concatenating of the digits of the first n primes. The first few are 2, 23, 235, ...