Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007815
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007815 Number of triangulations of cyclic 3-polytope C(3,n+3). +0
2
1, 2, 6, 25, 138, 972, 8477, 89505, 1119280, 16384508 (list; graph; listen)
OFFSET

1,2

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.

TOPCOM: Triangulations of Point Configurations and Oriented Matroids (ZIB Report 02-17). Proceedings of the International Congress of Mathematical Software ICMS 2002.

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. A028441.

Sequence in context: A128230 A084784 A135881 this_sequence A109286 A009466 A032479

Adjacent sequences: A007812 A007813 A007814 this_sequence A007816 A007817 A007818

KEYWORD

hard,nonn

AUTHOR

reiner(AT)math.umn.edu (Victor Reiner), edelman(AT)math.umn.edu (Paul Edelman)

EXTENSIONS

a(8) and a(9) computed by J. Rambau.

a(7) corrected and a(10) computed by Joerg Rambau (joerg.rambau(AT)uni-bayreuth.de), Sep 19 2006, using the TOPCOM software.

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 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research