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.

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.

Original entry on oeis.org

1, 4, 72, 24, 162816, 96576, 118464, 64896, 45888, 22464, 19776, 11904, 8640, 8448, 6144, 1728, 1152, 384, 384, 384
Offset: 1

Views

Author

N. J. A. Sloane, Apr 21 2020

Keywords

Comments

Rows 1 through 4 computed by Veit Elser, later confirmed by Tom Karzes.
The row sums give A333539.

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

Crossrefs

Cf. A333539, A333540, A333544, A338622 (number of k-faced polyhedra for the 3D Platonic solids).
For the number of hyperplanes see A007847.