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-4 of 4 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).

A242088 Number of edges in the convex hull of a rigorous solution to Thomson's problem for n points.

Original entry on oeis.org

0, 0, 1, 3, 6, 9, 12
Offset: 0

Views

Author

Jonathan Sondow, May 04 2014

Keywords

Comments

Thomson’s problem is to determine the stable equilibrium configuration(s) of n particles confined to the surface of a sphere and repelling each other by an inverse square force.
Rigorous solutions are known only for n <= 6 and n = 12, with a(12) = 30.
Non-rigorous solutions are given in Wikipedia for all n <= 460. The least non-monotonic pair is 63 > 60 for n = 23 and 24, respectively.

Examples

			For n = 0 or 1 points, the convex hull is empty or a point, so there are no edges and a(0) = a(1) = 0.
		

Crossrefs

Formula

a(n) <= n(n-1)/2 = (n choose 2).
a(n) <= 3*n-6 = A008585(n-2) for n >= 3, since a solution to Thomson's problem gives a planar graph, which has 3*n-6 edges if it is maximal (see A008486 comments). - Jonathan Sondow, Mar 03 2018 answering a question by Joseph Wheat.

A033177 Number of distinct distances between n electrons in minimal energy configuration on a sphere.

Original entry on oeis.org

0, 1, 1, 1, 3, 2, 4, 4, 6, 7, 20, 3, 28, 9, 21, 12, 14, 18, 52, 26, 69, 17, 48, 16, 160, 168
Offset: 1

Views

Author

K. S. Brown (ksbrown(AT)seanet.com)

Keywords

Comments

Most of the higher terms of this sequence just refer to the best configurations known today.
How is this defined if the optimal configuration is not unique? - N. J. A. Sloane, Feb 27 2009

Examples

			See Brown's web page in LINKS.
		

Crossrefs

A133491 Order of the symmetry group of the (in some cases conjectural) minimal-energy configuration of n identical charged particles confined to the surface of a sphere.

Original entry on oeis.org

12, 24, 12, 48, 20, 16, 12, 16, 4, 120, 4
Offset: 3

Views

Author

Keenan Pepper, Nov 30 2007

Keywords

Comments

a(0), a(1) and a(2) are all infinite, because their symmetry groups are continuous (they contain rotations with arbitrary angles). Actual symmetry groups: 3 D_{3h}, 4 T_{d}, 5 D_{3h}, 6 O_{d}, 7 D_{5h}, 8 D_{4d}, 9 D_{3h}, 10 D_{4h}, 11 D_{1h}, 12 I_{d}, 13 D_{1h}.

Examples

			a(3)=12 because the minimal-energy configuration of 3 charged particles on a sphere is an equilateral triangle on the equator, which has symmetry group D_3h of order 12.
		

Crossrefs

Showing 1-4 of 4 results.