|
| |
|
|
A084827
|
|
Maximum number of spheres of volume one that can be packed in a sphere of volume n.
|
|
4
| |
|
|
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, 14, 15, 15, 16, 16, 17, 18, 18, 19, 19, 19, 20, 21, 21, 21, 22, 22, 23, 23, 23, 25, 25, 26
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,8
|
|
|
COMMENTS
| 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).
|
|
|
LINKS
| Hugo Pfoertner, Numerical results for best packing of spheres in sphere.
Hugo Pfoertner, Densest packings of n equal spheres in a sphere of radius 1 (Table of largest possible radii)
Eric Weisstein's World of Mathematics, World of Mathematics: Sphere Packing.
|
|
|
EXAMPLE
| 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.
|
|
|
CROSSREFS
| Cf. A084828, A084829, A084824, A080865.
Sequence in context: A112205 A117953 A128331 * A029076 A036015 A130521
Adjacent sequences: A084824 A084825 A084826 * A084828 A084829 A084830
|
|
|
KEYWORD
| hard,more,nonn
|
|
|
AUTHOR
| Hugo Pfoertner (hugo(AT)pfoertner.org), Jun 09 2003
|
|
|
EXTENSIONS
| More terms from Hugo Pfoertner (hugo(AT)pfoertner.org), May 09 2005
|
| |
|
|
