Search Results for ""

A figurate number which is constructed as a centered cube with a square pyramid appended to each face, RhoDod_n = CCub_n+6P_(n-1)^((4)) (1) = (2n-1)(2n^2-2n+1), (2) where ...

A figurate number which is constructed as an octahedral number with a square pyramid removed from each of the six graph vertices, TO_n = O_(3n-2)-6P_(n-1)^((4)) (1) = ...

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 ...

There exist infinitely many odd integers k such that k·2^n-1 is composite for every n>=1. Numbers k with this property are called Riesel numbers, while analogous numbers with ...

A Poulet number whose divisors d all satisfy d|2^d-2. The first few are 341, 1387, 2047, 2701, 3277, 4033, 4369, 4681, 5461, 7957, 8321, ... (OEIS A050217).

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...

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 ...