Search Results for ""

The great icosidodecahedron, not to be confused with the great icosahedron or great icosicosidodecahedron, is the uniform polyhedron with Maeder index 54 (Maeder 1997), ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

The Curry triangle, also sometimes called the missing square puzzle, is a dissection fallacy created by American neuropsychiatrist L. Vosburgh Lions as an example of a ...

A deletable prime is a prime number which has the property that deleting digits one at a time in some order gives a prime at each step. For example, 410256793 is a deletable ...

The Flint Hills series is the series S_1=sum_(n=1)^infty(csc^2n)/(n^3) (Pickover 2002, p. 59). It is not known if this series converges, since csc^2n can have sporadic large ...

Solid partitions are generalizations of plane partitions. MacMahon (1960) conjectured the generating function for the number of solid partitions was ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

A cyclic number is an (n-1)-digit integer that, when multiplied by 1, 2, 3, ..., n-1, produces the same digits in a different order. Cyclic numbers are generated by the full ...

The Pierce expansion, or alternated Egyptian product, of a real number 0<x<1 is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...