|
|
A023393
|
|
Maximal number of circles of radius 1 that can be packed in a circle of radius n.
|
|
10
|
|
|
0, 1, 2, 7, 11, 19, 27, 38, 50, 64, 80, 98, 118
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
The terms for n>5 are only conjectures supported by extensive computations.
|
|
REFERENCES
|
R. L. Graham and B. D. Lubachevsky, Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4 and 5, Proc. First Int. Conf. "Computing and Combinatorics" COCOON'95, Springer Lecture Notes in Computer Science 959 (1996), 303-312.
For list of references given by E. Specht, see the Specht link.
|
|
LINKS
|
|
|
CROSSREFS
|
Cf. A201993 (conjectured lower bounds for a(n)).
|
|
KEYWORD
|
more,nonn,hard
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Mohammed Bouayoun (mohammed.bouayoun(AT)sanef.com), Feb 18 2004, writes to suggest that the sequence probably continues 138, 161, 187, 213, 242, 272, 304, 337, 373, 413, 451, 495, ...
|
|
STATUS
|
approved
|
|
|
|