|
|
A337019
|
|
Maximum number of circles with unit area that can be packed into an equilateral triangle with an area of n.
|
|
5
|
|
|
0, 1, 1, 1, 3, 3, 4, 6, 6, 6, 7, 8, 10, 10, 10, 11, 12, 13, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Are a(17) = 12 and a(18) = 13 proved? They look likely to be no more difficult to prove than some of the earlier terms, and are demonstrably lower bounds by the figures in the Friedman link. - Peter Munn, Apr 25 2023
The packing density, a(n)/n, approaches sqrt(3)*Pi/6 (approximately 0.9069) as n tends to infinity.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|