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.

Showing 1-1 of 1 results.

A080865 Order of symmetry groups of n points on 3-dimensional sphere with minimal distance between them maximized, also known as hostile neighbor or Tammes problem.

Original entry on oeis.org

24, 12, 48, 6, 16, 12, 4, 10, 120, 8, 8
Offset: 4

Views

Author

Hugo Pfoertner, Feb 21 2003

Keywords

Comments

If more than one best packing exists (this occurs for n = 15, 62, 76, 117, ...; see Buddenhagen, Kottwitz link) for a given n, the one with the largest symmetry group is chosen. A conjectured (except n=24) continuation of the sequence starting with n=15 would be: 3 16 4 2 2 12 1 1 1 24 3 2 4 1 1 6 5 6 3 2 1 4 2 24 1 3 1 10 1 2 1 2 1 24 2 12.

References

  • L. Fejes Toth, Lagerungen in der Ebene auf der Kugel und im Raum, 2nd. ed., Springer-Verlag, Berlin, Heidelberg 1972.

Crossrefs

A080866 gives the number of shortest edges which make up the rigid framework of the arrangement.
Cf. A342559 (point numbers where records of packing density occur).
Showing 1-1 of 1 results.