Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A019502
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A019502 Number of simplices in minimal decomposition of n-cube. +0
3
1, 2, 5, 16, 67 (list; graph; listen)
OFFSET

1,2

REFERENCES

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.

Sequence in context: A084785 A124551 A005157 this_sequence A019503 A019504 A005163

Adjacent sequences: A019499 A019500 A019501 this_sequence A019503 A019504 A019505

KEYWORD

nonn,hard,nice

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research