login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066342 Number of triangulations of the cyclic polytope C(n, n-4). 3
1, 2, 4, 8, 14, 25, 40, 67, 102, 165, 244, 387, 562, 881, 1264, 1967, 2798, 4333, 6124, 9451, 13290, 20457, 28648, 44007, 61414, 94181, 131044, 200675, 278498, 425953, 589792, 901087, 1245150, 1900509, 2621404, 3997659, 5504986, 8388569 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
M. Azaola and F. Santos, The number of triangulations of the cyclic polytope C(n,n-4), Discrete Comput. Geom., 27 (2002), 29-48.
FORMULA
See Maple line.
MAPLE
A066342 := n-> if n mod 2 = 0 then (n+4)*2^((n-4)/2)-n else ((3*n+11)/2)*2^((n-5)/2)-n; fi;
CROSSREFS
Sequence in context: A164157 A164175 A066456 * A340658 A291443 A210145
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 04 2002
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)