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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A019502 Number of simplices in minimal decomposition of n-cube. 3
1, 2, 5, 16, 67 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

A. Bliss, F. E. Su. Lower bounds for simplicial covers and triangulations of. cubes, Discrete Comput. Geom. 33 (2005), 669-686.

H. T. Croft, K. J. Falconer and R. K. Guy, Unsolved Problems in Geometry, C9.

R. B. Hughes and M. R. Anderson, Simplexity of the cube, Discr. Math., 158 (1996), 99-150.

CROSSREFS

Cf. A019503, A019504, A166932.

Sequence in context: A084785 A124551 A005157 * A019503 A019504 A005163

Adjacent sequences:  A019499 A019500 A019501 * A019503 A019504 A019505

KEYWORD

nonn,hard,nice,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:04 EST 2012. Contains 205969 sequences.