Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066634
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066634 Number of triangulations of the cyclic polytope C(n, n-5). +0
1
5, 16, 42, 138, 357, 1233, 3278, 12589, 35789, 159613, 499900, 2677865 (list; graph; listen)
OFFSET

5,1

REFERENCES

J. Rambau and F. Santos, The Baues problem for cyclic polytopes I, In "Special issue on Combinatorics of convex polytopes" (K. Fukuda and G. M. Ziegler, eds.), European J. Combin. 21:1 (2000), 65-83.

LINKS

C. A. Athanasiadis, J. A. De Loera, V. Reiner and F. Santos, Fiber polytopes for the projections between cyclic polytopes, European Journal of Combinatorics, Volume: 21, Issue: 1, 2000, pp. 19 - 47.

M. Azaola and F. Santos, The number of triangulations of the cyclic polytope C(n,n-4), Discrete Comput. Geom., 27 (2002), 29-48.

J. Rambau, TOPCOM

CROSSREFS

Cf. A066342, A028441.

Sequence in context: A055796 A002662 A143962 this_sequence A034358 A036888 A053221

Adjacent sequences: A066631 A066632 A066633 this_sequence A066635 A066636 A066637

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jan 09 2002

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research