login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238820 Number of triangulations of the vertex set of the n-dimensional cube. 1

%I

%S 1,1,2,74,92487256

%N Number of triangulations of the vertex set of the n-dimensional cube.

%C 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

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

%Y Cf. A238821.

%K nonn,more

%O 0,3

%A _N. J. A. Sloane_, Mar 06 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 16:24 EST 2019. Contains 329808 sequences. (Running on oeis4.)