A333543 Irregular triangle read by rows: T(n,k) (n >= 1, k >= n+1) is the number of cells with k vertices in the dissection of an n-dimensional cube by all the hyperplanes that pass through any n vertices.
1, 4, 72, 24, 162816, 96576, 118464, 64896, 45888, 22464, 19776, 11904, 8640, 8448, 6144, 1728, 1152, 384, 384, 384
Offset: 1
Examples
The two diagonals of a square cut it into four triangular pieces, so T(2,3) = 4. Triangle begins: 1, 4, 72, 24, 162816, 96576, 118464, 64896, 45888, 22464, 19776, 11904, 8640, 8448, 6144, 1728, 1152, 384, 384, 384, ...
References
- N. J. A. Sloane, Cutting Up a Cube, Math Fun Mailing List, Apr 10 2020; with replies from Tom Karzes, Tomas Rokicki, Veit Elser, and others.
Links
- Veit Elser, Rows 1 through 4
- Scott R. Shannon, Illustration for a(2) = 4.
- Scott R. Shannon, Illustration for a(3) = 72. This shows the 4-faced cells in the 3D cube dissection. The 72 pieces have been moved away from the origin a distance proportional to the average distance of their vertices from the origin.
- Scott R. Shannon, Illustration for a(4) = 24. This shows the 5-faced cells in the 3D cube dissection. The 24 pieces have been moved away from the origin a distance proportional to the average distance of their vertices from the origin. These polyhedra form a perfect octahedron inside the original cube with its points touching the cube's inner surface.
Comments