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

A063723 Number of vertices in the Platonic solids (in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron).

Original entry on oeis.org

4, 8, 6, 20, 12
Offset: 1

Views

Author

Henry Bottomley, Aug 14 2001

Keywords

Comments

The preferred order for these five numbers is 4, 6, 8, 12, 20 (tetrahedron, octahedron, cube, icosahedron, dodecahedron), as in A053016. - N. J. A. Sloane, Nov 05 2020
Also number of faces of Platonic solids ordered by increasing ratios of volumes to their respective circumscribed spheres. See cross-references for actual ratios. - Rick L. Shepherd, Oct 04 2009
Also the expected lengths of nontrivial random walks along the edges of a Platonic solid from one vertex back to itself. - Jens Voß, Jan 02 2014

Examples

			a(2) = 8 since a cube has eight vertices.
		

Crossrefs

Cf. A165922 (tetrahedron), A049541 (octahedron), A165952 (cube), A165954 (icosahedron), A165953 (dodecahedron). - Rick L. Shepherd, Oct 04 2009
Cf. A234974. - Jens Voß, Jan 02 2014

Formula

a(n) = A063722(n) - A053016(n) + 2.

A063722 Number of edges in the Platonic solids (in the order tetrahedron, cube, octahedron, dodecahedron, icosahedron).

Original entry on oeis.org

6, 12, 12, 30, 30
Offset: 1

Views

Author

Henry Bottomley, Aug 14 2001

Keywords

Examples

			a(2) = 12 since a cube has twelve edges.
		

Crossrefs

Formula

a(n) = A053016(n)+A063723(n)-2.

A063924 Number of 3-dimensional cells in the regular 4-dimensional polytopes.

Original entry on oeis.org

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

Views

Author

Henry Bottomley, Aug 15 2001

Keywords

Comments

Sorted by number of 3-dimensional cells.
Also, number of vertices of the regular 4-dimensional polyhedra. - Douglas Boffey, Aug 12 2012

Examples

			a(2) = 8 since a 4D hypercube contains eight cubes.
		

References

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

Crossrefs

Formula

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

Extensions

Corrected faces to cells by Douglas Boffey, Aug 12 2012

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

A093478 Number of regular (finite but not necessarily convex) polytopes of full rank in n-dimensional space, or -1 if the number is infinite.

Original entry on oeis.org

1, 1, -1, 18, 34, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6
Offset: 0

Views

Author

N. J. A. Sloane, May 22 2004

Keywords

References

  • P. McMullen and E. Schulte, Abstract Regular Polytopes, Encyclopedia of Mathematics and its Applications, Vol. 92, Cambridge University Press, Cambridge, 2002.

Crossrefs

A093479 Number of regular (infinite) apeirotopes of full rank in n-dimensional space.

Original entry on oeis.org

0, 1, 6, 8, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8
Offset: 0

Views

Author

N. J. A. Sloane, May 22 2004

Keywords

References

  • P. McMullen, Regular polytopes of full rank, lecture at The Coxeter Legacy meeting, Toronto, 2004.
  • P. McMullen and E. Schulte, Abstract Regular Polytopes, Encyclopedia of Mathematics and its Applications, Vol. 92, Cambridge University Press, Cambridge, 2002.
  • P. McMullen and E. Schulte, Paper to appear in Discrete and Computational Geometry, 2004.

Crossrefs

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

A358241 Number of connected Dynkin diagrams with n nodes.

Original entry on oeis.org

1, 3, 3, 5, 4, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
Offset: 1

Views

Author

Simon Burton, Jan 18 2023

Keywords

Comments

The sequence of connected Dynkin diagrams proceeds as {A1}, {A2, B2, G2}, {A3, B3, C3}, {A4, B4, F4, C4, D4}, {A5, B5, C5, D5}, {A6, B6, C6, D6, E6}, {A7, B7, C7, D7, E7}, {A8, B8, C8, D8, E8}, {A9, B9, C9, D9}, ...

References

  • R. W. Carter, Simple groups of Lie type. Vol. 22, John Wiley & Sons, 1989, p. 40.

Crossrefs

Formula

a(n) = 4 for n > 8.

Extensions

a(9) corrected by Andrey Zabolotskiy, Jul 23 2024

A374624 a(n) is the number of irreducible finite Coxeter groups in n dimensions, or -1 if there are an infinite number.

Original entry on oeis.org

1, -1, 3, 5, 3, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
Offset: 1

Views

Author

Douglas Boffey, Jul 14 2024

Keywords

Comments

For n > 8, the Coxeter groups are exactly A(n), B(n) = C(n), and D(n), hence a(n) = 3.

Examples

			For n = 4, there are five finite groups, denoted A(4) (symmetry group of the simplex), B(4) (= C(4)) (symmetry group of the tesseract and the 4-dimensional cross polytope), D(4) (symmetry group of the demitesseract), F(4) (symmetry group of the 24-cell) and H(4) (symmetry group of the 120-cell and the 600-cell).
		

References

  • H. S. M. Coxeter, Regular Polytopes, Dover Publications, Inc., 1973.

Crossrefs

Programs

  • Mathematica
    PadRight[{1, -1, 3, 5, 3, 4, 4, 4}, 100, 3] (* Paolo Xausa, Dec 07 2024 *)
  • PARI
    a(n)=if(n>8,3,[1,-1,3,5,3,4,4,4][n]) \\ Charles R Greathouse IV, Jul 15 2024

Formula

G.f.: (1 - 2*x + 4*x^2 + 2*x^3 - 2*x^4 + x^5 - x^8)/(1 - x). - Stefano Spezia, Jul 15 2024

A121273 Number of different n-dimensional convex regular polytopes that can tile n-dimensional space.

Original entry on oeis.org

1, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Sergio Pimentel, Aug 23 2006

Keywords

Comments

The only n-dimensional convex regular polytope that can tile n-dimensional space for all n>4 is the n-hypercube

Examples

			a(2)=3 because the plane can be tiled by equilateral triangles, squares or regular hexagons. a(3)=1 since the only platonic solid that can tile 3-dimensional space is the cube. a(4)=3 because the 4-dimensional space can be tiled by hypercubes (tesseracts), hyperoctahedra or 24-cell polytopes.
		

Crossrefs

Formula

a(n)=3 for n = 2 & 4. a(n)=1 for all other n.
Showing 1-10 of 11 results. Next