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.

A084828 Maximum number of spheres of radius one that can be packed in a sphere of radius n.

Original entry on oeis.org

1, 2, 13, 32, 68
Offset: 1

Views

Author

Hugo Pfoertner, Jun 12 2003

Keywords

Comments

a(4) and a(5) are experimental values. Although A121346(5) claims a lower bound of a(5)=68, it is conjectured from extensive numerical search that this value is unachievable and therefore a(5)=67.
The conjecture a(5)=67 was proved wrong by Yu Liang, who found an arrangement of 68 spheres of radius 1 fitting into a sphere of radius 5.
Lower bounds for the next terms are a(6)>=122 and a(7)>=198. See E. Specht's webpage for latest data. - Hugo Pfoertner, Jan 22 2024

Crossrefs

Cf. A121346 (conjectured lower bounds), A084827, A084829, A084825.
Cf. A023393 (2D).

Extensions

Comment and links edited, a(5) from Hugo Pfoertner, Jun 23 2011
a(5) corrected, based on private communication from Yu Liang, by Hugo Pfoertner, Aug 24 2011