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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006976 Coefficients of Chebyshev polynomials.
(Formerly M4907)
7
1, 13, 98, 560, 2688, 11424, 44352, 160512, 549120, 1793792, 5637632, 17145856, 50692096, 146227200, 412778496, 1143078912, 3111714816, 8341487616, 22052208640, 57567870976, 148562247680, 379364311040, 959384125440 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Binomial transform of A069039. - Paul Barry (pbarry(AT)wit.ie), Feb 19 2003

If X_1,X_2,...,X_n are 2-blocks of a (2n+1)-set X then, for n>=5, a(n-5) is the number of (n+6)-subsets of X intersecting each X_i, (i=1,2,...,n). - Milan R. Janjic (agnus(AT)blic.net), Nov 18 2007

REFERENCES

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 795.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Milan Janjic, Two Enumerative Functions

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

Index entries for sequences related to Chebyshev polynomials.

FORMULA

G.f.: (1-x)/(1-2x)^7. a(n)=2^n*binomial(n+5, 5)(n+12)/12.

a(n)=2^n(n+1)(n+2)(n+3)(n+4)(n+5)(n+12)/1440.

a(n)=sum{k=0..floor((n+12)/2), C(n+12, 2k)C(k, 6) } - Paul Barry (pbarry(AT)wit.ie), May 15 2003

CROSSREFS

a(n)= A039991(n+12, 12).

Partial sums are in A002409.

Sequence in context: A126508 A158795 A075899 * A034270 A201427 A155646

Adjacent sequences:  A006973 A006974 A006975 * A006977 A006978 A006979

KEYWORD

nonn,easy

AUTHOR

Simon Plouffe (simon.plouffe(AT)gmail.com)

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 21 2000

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 15 14:57 EST 2012. Contains 205823 sequences.