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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066456 Upper bound on number of regular triangulations of cyclic polytope C(n, n-4). 1
1, 1, 2, 4, 8, 14, 25, 40, 65, 97, 146, 206, 292, 394, 533, 694, 905, 1145, 1450, 1792, 2216, 2686, 3257, 3884, 4633, 5449, 6410, 7450, 8660, 9962, 11461, 13066, 14897, 16849, 19058, 21404, 24040, 26830, 29945, 33232 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

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.

MAPLE

A066456 := proc(n) local m; if n mod 2 = 0 then m := n/2; 6*binomial(m, 4)+3*binomial(m, 3)+4*binomial(m, 2)-m+2; else m := (n+1)/2; 6*binomial(m, 4)+5*binomial(m, 2)-4*m+5; fi; end;

CROSSREFS

Sequence in context: A164177 A164157 A164175 * A066342 A020956 A164153

Adjacent sequences:  A066453 A066454 A066455 * A066457 A066458 A066459

KEYWORD

nonn

AUTHOR

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

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 14 11:36 EST 2012. Contains 205623 sequences.