cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A257481 Consider a hole-less cluster of n circles in the hexagonal lattice packing of circles; a(n) is the maximal number of circles that touch 6 circles.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 3, 3, 4
Offset: 1

Views

Author

Peter Woodward, Apr 26 2015

Keywords

Examples

			For a(7), one circle can be completely enclosed by six surrounding circles, so a(7)=1, a(n)=0 for n<7.
For a(10), two circles can be completely enclosed by eight surrounding circles, so a(10)=2.
		

Crossrefs

Extensions

Edited by N. J. A. Sloane, May 18 2015