Search Results for ""

The 6-polyiamond illustrated above.

Let f(1)=1, and let f(n) be the number of occurrences of n in a nondecreasing sequence of integers. then the first few values of f(n) are 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, ... ...

If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

A roll of two 1s (the lowest roll possible) on a pair of six-sided dice. The probability of rolling snake eyes is 1/36, or 2.777...%.

The 6-polyiamond illustrated above.

A surface harmonic of degree l which is premultiplied by a factor r^l. Confusingly, solid harmonics are also known as "spherical harmonics" (Whittaker and Watson 1990, p. ...

The line segment connecting opposite polyhedron vertices (i.e., two polyhedron vertices which do not share a common face) in a parallelepiped or other similar solid. Also ...

A point which does not lie on at least one ordinary line.

The 6-polyiamond illustrated above, named for its resemblance to the Great Sphinx of Egypt.