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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066375 6*binomial(n,4)+3*binomial(n,3)+4*binomial(n,2)-n+2. 2
1, 4, 14, 40, 97, 206, 394, 694, 1145, 1792, 2686, 3884, 5449, 7450, 9962, 13066, 16849, 21404, 26830, 33232, 40721, 49414, 59434, 70910, 83977, 98776, 115454, 134164, 155065, 178322, 204106, 232594, 263969, 298420, 336142 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

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

a(n) = (8-14*n+13*n^2-4*n^3+n^4)/4. G.f.: x*(1-x+4*x^2+2*x^4)/(1-x)^5. [Colin Barker, Apr 20 2012]

PROG

(PARI) { for (n=1, 1000, a=6*binomial(n, 4) + 3*binomial(n, 3) + 4*binomial(n, 2) - n + 2; write("b066375.txt", n, " ", a) ) } [From Harry J. Smith, Feb 11 2010]

CROSSREFS

Sequence in context: A182819 A144141 A187594 * A093160 A001938 A066368

Adjacent sequences:  A066372 A066373 A066374 * A066376 A066377 A066378

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 | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 22 16:23 EDT 2014. Contains 247067 sequences.