Search Results for ""

A plane partition is a two-dimensional array of integers n_(i,j) that are nonincreasing both from left to right and top to bottom and that add up to a given number n. In ...

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...

The 13 Archimedean dual graphs are the skeletons of the Archimedean dual solids, illustrated above. Since they are polyhedral graphs, they are also planar. However, none of ...

1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...

The Bernoulli distribution is a discrete distribution having two possible outcomes labelled by n=0 and n=1 in which n=1 ("success") occurs with probability p and n=0 ...

Take x itself to be a bracketing, then recursively define a bracketing as a sequence B=(B_1,...,B_k) where k>=2 and each B_i is a bracketing. A bracketing can be represented ...

A bubble is a minimal-energy surface of the type that is formed by soap film. The simplest bubble is a single sphere, illustrated above (courtesy of J. M. Sullivan). More ...

The initially palindromic numbers 1, 121, 12321, 1234321, 123454321, ... (OEIS A002477). For the first through ninth terms, the sequence is given by the generating function ...

An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...