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-10 of 11 results. Next

A063927 Number of vertices in the regular 4-dimensional polytopes.

Original entry on oeis.org

5, 16, 8, 24, 600, 120
Offset: 1

Views

Author

Henry Bottomley, Aug 15 2001

Keywords

Comments

Sorted by number of 3-dimensional faces.

Examples

			a(2) = 16 since a 4D hypercube contains sixteen vertices.
		

References

  • H. S. M. Coxeter, Regular Polytopes, 3rd ed., Dover, NY, 1973.

Crossrefs

Formula

a(n) = A063926(n) - A063925(n) + A063924(n).

A063925 Number of 2-dimensional faces in the regular 4-dimensional polytopes.

Original entry on oeis.org

10, 24, 32, 96, 720, 1200
Offset: 1

Views

Author

Henry Bottomley, Aug 15 2001

Keywords

Comments

Sorted by number of 2-dimensional faces.
Also the number of edges in the regular 4-dimensional polytopes [Douglas Boffey, Aug 12 2012]

Examples

			a(2) = 24 since a 4D hypercube contains twenty-four faces.
		

References

  • H. S. M. Coxeter, Regular Polytopes, 3rd ed., Dover, NY, 1973.

Crossrefs

Formula

a(n) = A063924(n)+A063926(n)-A063927(n).

A063926 Number of edges in the six regular 4-dimensional polytopes.

Original entry on oeis.org

10, 32, 24, 96, 1200, 720
Offset: 1

Views

Author

Henry Bottomley, Aug 15 2001

Keywords

Comments

Sorted by number of 3-dimensional faces.

Examples

			a(2) = 32 since a 4D hypercube contains thirty-two edges.
		

References

  • H. S. M. Coxeter, Regular Polytopes, 3rd ed., Dover, NY, 1973.

Crossrefs

Formula

a(n) = A063927(n) + A063925(n) - A063924(n).

A199807 Sorted number of vertices of distinct solutions in the mix of 2 or 3 regular convex 4-polytopes.

Original entry on oeis.org

40, 120, 128, 192, 384, 600, 960, 960, 960, 1920, 2880, 3072, 4800, 4800, 7680, 14400, 14400, 15360, 23040, 23040, 36000, 46080, 72000, 115200, 115200, 115200, 288000, 4320000, 576000, 864000, 921600, 1728000, 2764800, 6912000, 13824000
Offset: 1

Views

Author

Jonathan Vos Post, Nov 10 2011

Keywords

Comments

Sorted 1st column of Table 2, p. 11, of Cunningham.

Examples

			a(1) = 40 because the mix of the pentatope {3,3,3} and the 16-cell hyperoctahedron {3,3,4} has 40 vertices, 480 edges, 1920 faces, 960 polyhedral facets, and an automorphism group of order 23040, and is itself polytopal (not every mix of polytope and polytope is a polytope).
		

Crossrefs

A199811 Sorted orders of automorphism groups of distinct solutions in the mix of 2 or 3 regular convex 4-polytopes.

Original entry on oeis.org

23040, 23040, 69120, 73728, 221184, 221184, 864000, 864000, 2764800, 2764800, 2764800, 2764800, 4423680, 8294400, 8294400, 13271040, 13271040, 42467328, 103680000, 165888000, 165888000, 165888000, 165888000, 497664000, 497664000, 530841600, 530841600, 1592524800, 1592524800, 1592524800, 1592524800, 6220800000, 19906560000, 19906560000, 59719680000
Offset: 1

Views

Author

Jonathan Vos Post, Nov 10 2011

Keywords

Comments

Sorted 5th column of Table 2, p. 11, of Cunningham.

Examples

			a(1) = 23040 because the mix of the pentatope {3,3,3} and the 16-cell hyperoctahedron {3,3,4} has 40 vertices, 480 edges, 1920 faces, 960 polyhedral facets, and an automorphism group of order 23040, and is itself polytopal (not every mix of polytope and polytope is a polytope).
		

Crossrefs

A317978 The number of ways to paint the cells of the six convex regular 4-polytopes using exactly n colors where n is the number of cells of each 4-polytope.

Original entry on oeis.org

2, 210, 108972864000, 1077167364120207360000
Offset: 1

Views

Author

Frank M Jackson, Aug 12 2018

Keywords

Comments

Let G, the group of rotations in 4 dimensional space, act on the set of n! paintings of each convex regular 4-polytopes having n cells. There are n! fixed points in the action table since the only element in G that leaves a painting fixed is the identity element. The order of G is A273509/2. So by Burnside's Lemma a(n)=n!/|G|. a(5) = 120!/7200 and a(6) = 600!/72000 and they are too large to display.
See A198861 for the Platonic solids which are the analogs of the regular polyhedra in three dimensions.
a(6) = 17577...66368*10^146 has 1405 digits. - Georg Fischer, Jun 16 2025

Examples

			The second of these six 4-polytopes (in sequence of cell count) is the 4-cube (with 8 cells). It has |G| = 192 rotations with n = 8. Hence a(2) = 8!/192 = 210.
		

Crossrefs

Programs

  • Maple
    {5!/60, 8!/192, 16!/192, 24!/576, 120!/7200, 600!/7200};
  • Mathematica
    {5!/60, 8!/192, 16!/192, 24!/576, 120!/7200, 600!/7200}

Formula

a(n) = 2*A063924(n)! / A273509(n). [Corrected by Georg Fischer, Jun 16 2025]

A359662 Number of (3-dimensional) cells of regular m-polytopes for m >= 3.

Original entry on oeis.org

1, 5, 8, 15, 16, 24, 35, 40, 70, 80, 120, 126, 160, 210, 240, 330, 495, 560, 600, 715, 1001, 1120, 1365, 1792, 1820, 2016, 2380, 3060, 3360, 3876, 4845, 5280, 5376, 5985, 7315, 7920, 8855, 10626, 11440, 12650, 14950, 15360, 16016, 17550, 20475, 21840, 23751
Offset: 1

Views

Author

Marco Ripà, Jan 10 2023

Keywords

Comments

In 3 dimensions there are five (convex) regular polytopes and each of them (trivially) consists of a single cell.
In 4 dimensions there are six regular 4-polytopes and they have 5, 8, 16, 24, 120, 600 3-dimensional cells (A063924).
In m >= 5 dimensions, there are only 3 regular polytopes (i.e., the m-simplex, the m-cube, and the m-crosspolytope) so that we can sort their number of (3-dimensional) cells in ascending order and define the present sequence.

Examples

			8 is a term since the hypersurface of a tesseract consists of 8 (cubical) cells.
		

Crossrefs

Cf. A359201 (edges), A359202 (faces).

Formula

Equals {{24, 120, 600} U {A000332} U {A001789} U {A130810}} \ {0}.

A140800 Total number of vertices in all finite n-dimensional convex regular polytopes, or 0 if the number is infinite.

Original entry on oeis.org

1, 2, 0, 50, 773, 48, 83, 150, 281, 540, 1055, 2082, 4133, 8232, 16427, 32814, 65585, 131124, 262199, 524346, 1048637, 2097216, 4194371, 8388678, 16777289, 33554508, 67108943, 134217810, 268435541, 536871000, 1073741915, 2147483742
Offset: 0

Views

Author

Jonathan Vos Post, Jul 15 2008

Keywords

Comments

Andrew Weimholt suggests a related sequence, namely "total number of vertices in all finite n-dimensional regular polytopes, or 0 if the number is infinite, includes both convex and non-convex, beginning: 1, 2, 0, 106, 2453, 48, 83, 150, 281, 540, ... and writes that the sequence of just the non-convex cases (0, 0, -1, 56, 1680, 0, 0, 0, ..., where "-1" indicates infinity as zero is otherwise employed) is not as interesting, since it's all zeros from a(5) on.

Examples

			a(0) = 1 because the 0-D regular polytope is the point.
a(1) = 2 because the only regular 1-D polytope is the line segment, with 2 vertices, one at each end.
a(2) = 0, indicating infinity, because the regular k-gon has k vertices.
a(3) = 50 (4 for the tetrahedron, 6 for the octahedron, 8 for the cube, 12 for the icosahedron, 20 for the dodecahedron) = the sum of A053016.
a(4) = 773 = 5 + 8 + 16 + 24 + 120 + 600 = sum of A063924.
For n>4 there are only the three regular n-dimensional polytopes, the simplex with n+1 vertices, the hypercube with 2^n vertices and the hyperoctahedron = cross polytope = orthoplex with 2*n vertices, for a total of A086653(n) + 1 = 2^n + 3*n + 1 (again restricted to n > 4).
		

References

  • H. S. M. Coxeter, Regular Polytopes, 3rd ed., Dover, NY, 1973.
  • Branko Grunbaum, Convex Polytopes, second edition (first edition (1967) written with the cooperation of V. L. Klee, M. Perles and G. C. Shephard; second edition (2003) prepared by V. Kaibel, V. L. Klee and G. M. Ziegler), Graduate Texts in Mathematics, Vol. 221, Springer 2003.
  • P. McMullen and E. Schulte, Abstract Regular Polytopes, Encyclopedia of Mathematics and its Applications, Vol. 92, Cambridge University Press, Cambridge, 2002.

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{4, -5, 2}, {1, 2, 0, 50, 773, 48, 83, 150}, 32] (* Georg Fischer, May 03 2019 *)

Formula

For n > 4, a(n) = A086653(n) + 1 = 2^n + 3*n + 1.
G.f.: -(1488*x^7 - 3656*x^6 + 2794*x^5 - 569*x^4 - 58*x^3 + 3*x^2 + 2*x - 1)/((1-x)^2*(1-2*x)). [Colin Barker, Sep 05 2012]

Extensions

a(14)-a(15) corrected by Georg Fischer, May 02 2019

A199808 Sorted number of edges of distinct solutions in the mix of 2 or 3 regular convex 4-polytopes.

Original entry on oeis.org

480, 1536, 1920, 4608, 5760, 14400, 18432, 34560, 46080, 57600, 72000, 92160, 138240, 230400, 276480, 691200, 691200, 884736, 1105920, 1728000, 2211840, 2764800, 3456000, 6635520, 8294400, 11059200, 13824000, 26542080, 33177600, 41472000, 82944000, 103680000, 132710400, 331776000, 995328000
Offset: 1

Views

Author

Jonathan Vos Post, Nov 10 2011

Keywords

Comments

Also sorted number of faces of distinct solutions in the mix of 2 or 3 regular convex 4-polytopes. Sorted 2nd or 3rd column of Table 2, p. 11, of Cunningham.

Examples

			a(1) = 480 because the mix of the pentatope {3,3,3} and the 16-cell hyperoctahedron {3,3,4} has 40 vertices, 480 edges, 1920 faces, 960 polyhedral facets, and an automorphism group of order 23040, and is itself polytopal (not every mix of polytope and polytope is a polytope).
		

Crossrefs

A306602 Number of elements in the ten nonconvex regular 4-polytopes (regular 4-dimensional star-polytopes), as a four-column array, read by rows, with rows ordered first by increasing density, then by increasing cell-count, then by increasing face-count, then by increasing edge-count and then by increasing vertex-count.

Original entry on oeis.org

120, 720, 1200, 120, 120, 1200, 720, 120, 120, 720, 720, 120, 120, 720, 720, 120, 120, 720, 720, 120, 120, 720, 720, 120, 120, 720, 1200, 120, 120, 1200, 720, 120, 120, 720, 1200, 600, 600, 1200, 720, 120
Offset: 1

Views

Author

Felix Fröhlich, Feb 27 2019

Keywords

Comments

Only included for completeness (see other sequences in crossrefs). This is one of those entries that I think should be included since it is such an elementary sequence in geometry, but where the terms do otherwise not really make a very spectacular sequence.
The ordering of the polytopes in the enumeration of the element counts is somewhat arbitrary, though based on invariants inherently associated with these polytopes. For example, ordering first by vertex-count, then by edge-count, then by face-count and then by cell-count might have been as good a choice as the one used for the sequence.

Examples

			Polytope            | Schläfli symbol | Density | Cells | Faces | Edges | Vertices
----------------------------------------------------------------------------------
Sm st 120-cell      | {5/2,5,3}       |       4 |   120 |   720 |  1200 |      120
Ico 120-cell        | {3,5,5/2}       |       4 |   120 |  1200 |   720 |      120
Grt 120-cell        | {5,5/2,5}       |       6 |   120 |   720 |   720 |      120
Grd 120-cell        | {5,3,5/2}       |      20 |   120 |   720 |   720 |      120
Grt st 120-cell     | {5/2,3,5}       |      20 |   120 |   720 |   720 |      120
Grd st 120-cell     | {5/2,5,5/2}     |      66 |   120 |   720 |   720 |      120
Grt grd 120-cell    | {5,5/2,3}       |      76 |   120 |   720 |  1200 |      120
Grt ico 120-cell    | {3,5/2,5}       |      76 |   120 |  1200 |   720 |      120
Grt grd st 120-cell | {5/2,3,3}       |     191 |   120 |   720 |  1200 |      600
Grd 600-cell        | {3,3,5/2}       |     191 |   600 |  1200 |   720 |      120
======================
| Keys               |
======================
| Sm   | Small       |
| St   | Stellated   |
| Grt  | Great       |
| Grd  | Grand       |
| Ico  | Icosahedral |
======================
		

Crossrefs

Showing 1-10 of 11 results. Next