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

A333540 A333539(n)/n!.

Original entry on oeis.org

1, 2, 16, 23752
Offset: 1

Views

Author

N. J. A. Sloane, Apr 14 2020, following a suggestion from Veit Elser

Keywords

References

Crossrefs

A338622 Irregular table read by rows: The number of k-faced polyhedra, where k>=4, formed when the five Platonic solids, in the order tetrahedron, octahedron, cube, icosahedron, dodecahedron, are internally cut by all the planes defined by any three of their vertices.

Original entry on oeis.org

1, 8, 72, 24, 2160, 360, 205320, 208680, 94800, 34200, 7920, 1560, 120
Offset: 1

Views

Author

Scott R. Shannon, Nov 04 2020

Keywords

Comments

See A338571 for further details and images of this sequence.
The author thanks Zach J. Shannon for producing the images for this sequence.

Examples

			The cube is cut with 14 internal planes defined by all 3-vertex combinations of its 8 vertices. This leads to the creation of 72 4-faced polyhedra and 24 5-faced polyhedra, 96 pieces in all. See A338571 and A333539.
The table is:
1;
8;
72, 24;
2160, 360;
205320, 208680, 94800, 34200, 7920, 1560, 120;
		

Crossrefs

Cf. A338571 (total number of polyhedra), A333539 (n-dimensional cube), A053016, A063722, A063723, A098427, A333543.

Formula

Sum of row n = A338571(n).

A007847 Number of hyperplanes spanned by the vertices of an n-cube.

Original entry on oeis.org

2, 6, 20, 140, 3254, 252434, 71343208, 86246755608, 448691419804586
Offset: 1

Views

Author

Oswin Aichholzer (oaich(AT)igi.tu-graz.ac.at)

Keywords

Comments

This is the count of (n-1)-dimensional hyperplanes spanned by any n vertices of a unit cube in dimension n. - N. J. A. Sloane, Apr 14 2020
This is also the number of cocircuits of any point configuration combinatorially equivalent to the unit cube in dimension n. - Jörg Rambau, Jun 06 2023

Examples

			For n=2 there are the four edges of the square and the two diagonals, for a total of 6. - _N. J. A. Sloane_, Apr 14 2020
From _Tom Karzes_, Apr 14 2020: (Start)
The classes of hyperplanes are listed below for d = 2-5.  Each class is shown below preceded by the number of instances of that class.
I define two hyperplanes as being in the same class if the vertex set of one can be transformed to the vertex set of the other by some combination of (1) permuting the coordinates and (2) inverting some set of coordinates (1->0 and 0->1).
For d=2 there are 2 classes hyperplanes (i.e., lines):
      4:  00 01
      2:  00 11
This gives a total of 6.  The first class corresponds to the 4 perimeter slices.
For d=3 there are 3 classes of hyperplanes (i.e., planes):
      6:  000 001 010 011
      6:  000 001 110 111
      8:  000 011 101
This gives a total of 20.  The first class corresponds to the 6 perimeter slices.
For d=4 there are 6 classes of hyperplanes:
      8:  0000 0001 0010 0011 0100 0101 0110 0111
     12:  0000 0001 0010 0011 1100 1101 1110 1111
     32:  0000 0001 0110 0111 1010 1011
     16:  0000 0011 0101 1001
      8:  0000 0011 0101 1010 1100 1111
     64:  0000 0011 0101 1110
This gives a total of 140.  The first class corresponds to the 8 perimeter slices.
For d=5 there are 15 classes of hyperplanes:
     10:  00000 00001 00010 00011 00100 00101 00110 00111 01000 01001 01010 01011 01100 01101 01110 01111
     20:  00000 00001 00010 00011 00100 00101 00110 00111 11000 11001 11010 11011 11100 11101 11110 11111
     80:  00000 00001 00010 00011 01100 01101 01110 01111 10100 10101 10110 10111
     80:  00000 00001 00110 00111 01010 01011 10010 10011
     40:  00000 00001 00110 00111 01010 01011 10100 10101 11000 11001 11110 11111
    320:  00000 00001 00110 00111 01010 01011 11100 11101
     32:  00000 00011 00101 01001 10001
     32:  00000 00011 00101 01001 10010 10100 10111 11000 11011 11101
     80:  00000 00011 00101 01001 10110 11010 11100 11111
    160:  00000 00011 00101 01001 11110
    160:  00000 00011 00101 01010 01100 01111 10110
    320:  00000 00011 00101 01110 10110
    320:  00000 00011 00101 01110 11000 11011 11101
    640:  00000 00011 00101 01110 11001
    960:  00000 00011 01101 10101 11010
This gives a total of 3254.  The first class corresponds to the 10 perimeter slices.
(End)
TOPCOM as of versions >= 1.0.0 can now compute these numbers up to n=9 and the same numbers up to symmetry. The computed numbers coincide with the preceding comment for dimensions from 2 through 5. - _Jörg Rambau_, Jun 06 2023
		

References

  • O. Aichholzer, F. Aurenhammer, Classifying Hyperplanes in Hypercubes, 10th European Workshop on Computational Geometry, Santander, Spain, March 1994.

Crossrefs

See A333539 for the number of pieces formed when the cube is cut along these hyperplanes.
Cf. A363505 for the same numbers up to symmetry.
Cf. A363512 for the total numbers dual to these (in the oriented-matroid sense)
Cf. A363506 for the numbers dual to these up to symmetry (in the oriented-matroid sense)

Extensions

Edited by M. F. Hasler, Apr 05 2015
a(9) from Jörg Rambau, Jun 06 2023

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.

A338571 Number of polyhedra formed when the five Platonic solids, in the order tetrahedron, octahedron, cube, icosahedron, dodecahedron, are internally cut by all the planes defined by any three of their vertices.

Original entry on oeis.org

1, 8, 96, 2520, 552600
Offset: 1

Views

Author

Scott R. Shannon, Nov 03 2020

Keywords

Comments

For a Platonic solid create all possible planes defined by connecting any three of its vertices. For example, in the case of a cube this results in fourteen planes; six planes between the pairs of parallel edges connected to each end of the face diagonals, and eight planes from connecting the three vertices adjacent to each corner vertex. Use all the resulting planes to cut the solid into individual smaller polyhedra. The sequence lists the numbers of resulting polyhedra for the Platonic solids, ordered by number of vertices: tetrahedron, octahedron, cube, icosahedron, dodecahedron.
See A338622 for the number and images of the k-faced polyhedra in each dissection for each of the five solids.
The author thanks Zach J. Shannon for producing the images for this sequence.

Examples

			a(1) = 1. The tetrahedron has no internal cutting planes so the single polyhedron after cutting is the tetrahedron itself.
a(2) = 8. The octahedron has 3 internal cutting planes resulting in 8 polyhedra.
a(3) = 96. The cube has 14 internal cutting planes resulting in 96 polyhedra. See also A333539.
a(4) = 2520. The icosahedron has 47 cutting planes resulting in 2520 polyhedra.
See A338622 for a breakdown of the above totals into the corresponding number of k-faced polyhedra.
a(5) = 552600. The dodecahedron has 307 internal cutting planes resulting in 552600 polyhedra. It is the only Platonic solid which produces polyhedra with 6 or more faces.
		

Crossrefs

Cf. A338622 (number of k-faced polyhedra in each dissection), A333539 (n-dimensional cube), A053016, A063722, A063723, A098427.

A338783 Number of polyhedra formed when an n-prism, formed from two n-sided regular polygons joined by n adjacent rectangles, is internally cut by all the planes defined by any three of its vertices.

Original entry on oeis.org

18, 96, 1335, 4524, 29871, 65344, 319864, 594560
Offset: 3

Views

Author

Scott R. Shannon, Nov 08 2020

Keywords

Comments

For an n-prism, formed from two n-sided regular polygons joined by n adjacent rectangles, create all possible internal planes defined by connecting any three of its vertices. For example, in the case of a triangular prism this results in 6 planes. Use all the resulting planes to cut the prism into individual smaller polyhedra. The sequence lists the number of resulting polyhedra for prisms with n>=3.
See A338801 for the number and images of the k-faced polyhedra in each prism dissection.
The author thanks Zach J. Shannon for assistance in producing the images for this sequence.

Examples

			a(3) = 18. The triangular 3-prism has 6 internal cutting planes resulting in 18 polyhedra; seventeen 4-faced polyhedra and one 6-faced polyhedron.
a(4) = 96. The square 4-prism (a cuboid) has 14 internal cutting planes resulting in 96 polyhedra; seventy-two 4-faced polyhedra and twenty-four 5-faced polyhedra. See A338622.
		

Crossrefs

Cf. A338801 (number of k-faced polyhedra), A338806 (antiprism), A338571 (Platonic solids), A338622 (k-faced polyhedra in Platonic solids), A333539 (n-dimensional cube).

A338806 Number of polyhedra formed when an n-antiprism, formed from two n-sided regular polygons joined by 2n adjacent alternating triangles, is internally cut by all the planes defined by any three of its vertices.

Original entry on oeis.org

8, 195, 834, 6365, 22770, 81769, 271702, 688793
Offset: 3

Views

Author

Scott R. Shannon, Nov 10 2020

Keywords

Comments

For an n-antiprism, formed from two n-sided regular polygons joined by 2n adjacent alternating triangles, create all possible internal planes defined by connecting any three of its vertices. For example, in the case of a triangular 3-antiprism this results in 3 planes. Use all the resulting planes to cut the prism into individual smaller polyhedra. The sequence lists the number of resulting polyhedra for antiprisms with n>=3.
See A338808 for the number and images of the k-faced polyhedra in each antiprism dissection.
The author thanks Zach J. Shannon for assistance in producing the images for this sequence.

Examples

			a(3) = 8. The 3-antiprism is cut with 3 internal planes resulting in 8 polyhedra, all 8 pieces having 4 faces.
a(4) = 195. The 4-antiprism is cut with 16 internal planes resulting in 195 polyhedra; 128 with 4 faces, 56 with 5 faces, 8 with 6 faces, and 3 with 8 faces. Note the number of 8-faced polyhedra is not a multiple of 4 - they lie directly along the z-axis so are not symmetric with respect to the number of edges forming the regular n-gons.
		

Crossrefs

Cf. A338808 (number of k-faced polyhedra), A338783 (regular prism), A338571 (Platonic solids), A333539 (n-dimensional cube).

A338809 Number of polyhedra formed when an n-bipyramid, formed from two n-gonal pyraminds joined at the base, is internally cut by all the planes defined by any three of its vertices.

Original entry on oeis.org

12, 8, 120, 108, 756, 704, 3384, 3340, 11880, 10032, 33800, 32312, 82440, 78656, 182172, 144540, 365712, 350600
Offset: 3

Views

Author

Scott R. Shannon, Nov 10 2020

Keywords

Comments

For a n-bipyramid, formed from two n-gonal pyraminds joined at the base, create all possible internal planes defined by connecting any three of its vertices. For example, in the case of a 3-bipyramid this results in 4 planes. Use all the resulting planes to cut the n-bipyramid into individual smaller polyhedra. The sequence lists the number of resulting polyhedra for bipyramids with n>=3.
See A338825 for the number and images of the k-faced polyhedra in each bipyramid dissection.
The author thanks Zach J. Shannon for assistance in producing the images for this sequence.

Examples

			a(3) = 12. The 3-bipyramid is cut with 4 internal planes resulting in 12 polyhedra, all 12 pieces having 4 faces.
a(5) = 120. The 5-bipyramid is cut with 16 internal planes resulting in 120 polyhedra, all 120 pieces having 4 faces.
a(7) = 756. The 7-bipyramid is cut with 36 internal planes resulting in 756 polyhedra; 448 with 4 faces, 280 with 5 faces, and 28 with 6 faces.
Note that for a single n-pyramid the number of polyhedra is the same as the number of regions in the dissection of a 2D n-polygon, see A007678, as all planes join two points on the polygon and the single apex, resulting in an equivalent number of regions.
		

Crossrefs

Cf. A338825 (number of k-faced polyhedra), A338571 (Platonic solids), A333539 (n-dimensional cube), A007678 (2D n-polygon).

A333544 Irregular triangle read by rows, formed from the triangle A333543 by dividing the terms in row n by n!.

Original entry on oeis.org

1, 2, 12, 4, 6784, 4024, 4936, 2704, 1912, 936, 824, 496, 360, 352, 256, 72, 48, 16, 16, 16
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.
Row sums are A333540.
See A333543 for further information.

Examples

			Triangle begins:
1,
2,
12, 4,
6784, 4024, 4936, 2704, 1912, 936, 824, 496, 360, 352, 256, 72, 48, 16, 16, 16
...
		

References

Crossrefs

A347753 Number of polyhedra formed when a row of n adjacent cubes are internally cut by all the planes defined by any three of their vertices.

Original entry on oeis.org

96, 2968, 42384, 319416
Offset: 1

Views

Author

Scott R. Shannon, Sep 12 2021

Keywords

Comments

For a row of n adjacent cubes create all possible planes defined by connecting any three of their vertices. For example, in the case of a single cube this results in fourteen planes; six planes between the pairs of parallel edges connected to each end of the face diagonals, and eight planes from connecting the three vertices adjacent to each corner vertex. Use all the resulting planes to cut the entire solid into individual smaller polyhedra. The sequence lists the numbers of resulting polyhedra for n adjacent cubes.
See A347918 for the number of k-faced polyhedra for each value of n.

Examples

			a(1) = 96. A single cube, with eight vertices, has 14 internal cutting planes resulting in 96 polyhedra. See A333539 and A338571.
a(2) = 2968. Two adjacent cubes, with twelve vertices, have 51 internal cutting planes resulting in 2968 polyhedra.
a(3) = 42384. Three adjacent cubes, with sixteen vertices, have 124 internal cutting planes resulting in 42384 polyhedra.
a(4) = 319416. Four adjacent cubes, with twenty vertices, have 245 internal cutting planes resulting in 319416 polyhedra.
		

Crossrefs

Cf. A347918 (number of k-faced polyhedra), A333539 (n-dimensional cube), A338571 (Platonic solids), A338783 (n-prism), A338809 (n-bipyramid), A007588.

Formula

a(1) = A333539(3).
Conjectured formula for the number of internal cutting planes for n adjacent cubes is A007588(n+1).
Showing 1-10 of 11 results. Next