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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053131 Binomial coefficients C(2n-8,9). 6
10, 220, 2002, 11440, 48620, 167960, 497420, 1307504, 3124550, 6906900, 14307150, 28048800, 52451256, 94143280, 163011640, 273438880, 445891810, 708930508, 1101716330, 1677106640, 2505433700, 3679075400, 5317936260 (list; graph; refs; listen; history; text; internal format)
OFFSET

9,1

COMMENTS

a(n)=-A053123(n,9), n >= 9; a(n) := 0, n=0..8 (tenth column of shifted Chebyshev's S-triangle, decreasing order)

a(n)=2*A053133(n).

REFERENCES

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

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 9..200

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

a(n)= binomial(2*n-8, 9) if n >= 9 else 0; G.f. (10+120*x+252*x^2+120*x^3+10*x^4)/(1-x)^10.

MATHEMATICA

Binomial[2*Range[9, 40]-8, 9] (* From Harvey P. Dale, Mar 19 2012 *)

PROG

(MAGMA)[Binomial(2*n-8, 9): n in [9..40]]; // Vincenzo Librandi, Oct 07 2011

CROSSREFS

Cf. A053123, A053130.

Sequence in context: A024291 A024292 A094420 * A166181 A199748 A210137

Adjacent sequences:  A053128 A053129 A053130 * A053132 A053133 A053134

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang

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 25 10:04 EDT 2013. Contains 225647 sequences.