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-2 of 2 results.

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]

A309442 Minimum number of colors needed to color the cells of the six regular convex polychora such that no two cells with a common face share the same color (in the order 5-cell, 8-cell, 16-cell, 24-cell, 120-cell, 600-cell).

Original entry on oeis.org

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

Views

Author

Sangeet Paul, Aug 03 2019

Keywords

Comments

Here, cells are 3-dimensional polyhedra, and faces are 2-dimensional polygons.
The sequence is the 4-dimensional analog of A244951.
The sequence is also the minimum number of colors needed to color the vertices of the six regular convex polychora such that no two vertices with a common edge share the same color (in the order 5-cell, 16-cell, 8-cell, 24-cell, 600-cell, 120-cell).

Examples

			a(1) = 5, since in the 5-cell, each cell has a common face with every other cell (analogous to the tetrahedron, where each face has a common edge with every other face).
a(2) = 4, since in the 8-cell, each cell has a common face with every other cell except its "opposite" cell (analogous to the cube, where each face has a common edge with every other face except its opposite face).
a(3) = 2, since the 16-cell's dual graph has no odd-edge cycles (analogous to the octahedron's dual graph having no odd-edge cycles).
a(4) = 3, since the 24-cell has at least one 3-color solution, and its dual graph has a 3-vertex subgraph with no 2-color solution.
a(5) = 5, since the 120-cell has at least one 5-color solution, and its dual graph has a 30-vertex subgraph with no 4-color solution.
a(6) = 3, since the 600-cell has at least one 3-color solution, and its dual graph has a 5-vertex subgraph with no 2-color solution.
		

Crossrefs

Showing 1-2 of 2 results.