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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066368 (n+2)*2^(n-1)-2*n. 2
1, 1, 4, 14, 40, 102, 244, 562, 1264, 2798, 6124, 13290, 28648, 61414, 131044, 278498, 589792, 1245150, 2621404, 5504986, 11534296, 24117206, 50331604, 104857554, 218103760, 452984782, 939524044, 1946157002, 4026531784 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Harry J. Smith, Table of n, a(n) for n=0..200

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

G.f.: (1-5*x+11*x^2-9*x^3)/((1-x)^2*(1-2*x)^2). [Colin Barker, Apr 19 2012]

PROG

(PARI) { for (n=0, 200, write("b066368.txt", n, " ", (n + 2)*2^(n - 1) - 2*n) ) } [From Harry J. Smith, Feb 11 2010]

CROSSREFS

Sequence in context: A066375 A093160 A001938 * A160463 A121593 A160527

Adjacent sequences:  A066365 A066366 A066367 * A066369 A066370 A066371

KEYWORD

nonn,easy

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 | 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 May 20 18:12 EDT 2013. Contains 225464 sequences.