A238820 Number of triangulations of the vertex set of the n-dimensional cube.

1, 1, 2, 74, 92487256

Offset

0,3

Comments

The number of triangulations of the n-cube is a distant cousin of Catalan numbers as they both count triangulations of some set of points. - Lionel Pournin, Mar 06 2014

References

Lionel Pournin, The flip-graph of the 4-dimensional cube is connected, Discrete Comput. Geom. 49 (2013), no. 3, 511--530.MR3038527

Links

Table of n, a(n) for n=0..4.

Michael Joswig, Max Klimm, and Sylvain Spitz, The Polyhedral Geometry of Truthful Auctions, arXiv:2211.01907 [cs.GT], 2022. See Table 1 at page 8.

Lionel Pournin, The flip-graph of the 4-dimensional cube is connected, arXiv:1201.6543 [math.MG], 2012.

Crossrefs

Cf. A238821.

Sequence in context: A062552 A116172 A358383 * A000329 A091978 A282966

Adjacent sequences: A238817 A238818 A238819 * A238821 A238822 A238823

Keyword

nonn,hard,more

Author

N. J. A. Sloane, Mar 06 2014

Status

approved