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.
%I A084827 #15 Feb 16 2025 08:32:49 %S A084827 1,1,1,1,1,1,1,2,2,2,3,4,4,4,6,6,6,7,8,8,9,9,10,10,12,12,13,13,13,14, %T A084827 14,15,15,16,16,17,18,18,19,19,19,20,21,21,21,22,22,23,23,23,25,25,26, %U A084827 26,26,27,28,28,29,29,30,31,31,32,33,33,34,34,35,36,36,38,38,38,38,39,39,40,40,42,42,42,43,43,44 %N A084827 Maximum number of spheres of volume one that can be packed in a sphere of volume n. %C A084827 Higher terms of the sequence are only conjectures derived from numerical results. The first 12 arrangements are identical with the solutions of the Tammes problem (see A080865). %H A084827 Hugo Pfoertner, <a href="/A084827/b084827.txt">Table of n, a(n) for n = 1..132</a> %H A084827 Hugo Pfoertner, <a href="http://oeis.org/A084829/a084829.txt">Densest packings of n equal spheres in a sphere of radius 1</a> (Table of largest possible radii) %H A084827 Hugo Pfoertner, <a href="/A084827/a084827.txt">Numerical results for best packing of spheres in sphere.</a> %H A084827 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SpherePacking.html">World of Mathematics: Sphere Packing.</a> %e A084827 a(10)=2 because a sphere of volume 10 is slightly too small to cover 3 mutually touching spheres of volume 1. a(27)=13 because the arrangement of 12 spheres plus one central sphere needs exactly a sphere with R=3*r to be contained. %Y A084827 Cf. A084828, A084829, A084824, A080865. %K A084827 hard,nonn %O A084827 1,8 %A A084827 _Hugo Pfoertner_, Jun 09 2003 %E A084827 More terms from _Hugo Pfoertner_, May 09 2005