|
|
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.
|
|
2
|
|
|
0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 3, 3, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,10
|
|
LINKS
|
|
|
EXAMPLE
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|