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.

A337019 Maximum number of circles with unit area that can be packed into an equilateral triangle with an area of n.

Original entry on oeis.org

0, 1, 1, 1, 3, 3, 4, 6, 6, 6, 7, 8, 10, 10, 10, 11, 12, 13, 15
Offset: 1

Views

Author

Ya-Ping Lu, Nov 05 2020

Keywords

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.

Crossrefs

Formula

Limit_{n->oo} a(n)/n = A093766.

Extensions

Terms corrected by Andrew Howroyd and Peter Munn, Apr 23 2023