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.

This page as a plain text file.
%I A337019 #39 Apr 25 2023 11:17:02
%S A337019 0,1,1,1,3,3,4,6,6,6,7,8,10,10,10,11,12,13,15
%N A337019 Maximum number of circles with unit area that can be packed into an equilateral triangle with an area of n.
%C A337019 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
%C A337019 The packing density, a(n)/n, approaches sqrt(3)*Pi/6 (approximately 0.9069) as n tends to infinity.
%H A337019 Erich Friedman, <a href="https://erich-friedman.github.io/packing/cirintri/">Circles in Triangles</a>
%H A337019 Wikipedia, <a href="https://en.wikipedia.org/wiki/Circle_packing_in_an_equilateral_triangle">Circle packing in an equilateral triangle</a>
%F A337019 Limit_{n->oo} a(n)/n = A093766.
%Y A337019 Cf. A093766, A269110.
%K A337019 nonn,more
%O A337019 1,5
%A A337019 _Ya-Ping Lu_, Nov 05 2020
%E A337019 Terms corrected by _Andrew Howroyd_ and _Peter Munn_, Apr 23 2023