login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A213380
a(n) = 132*binomial(n,12).
(Formerly N2345)
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 132, 1716, 12012, 60060, 240240, 816816, 2450448, 6651216, 16628040, 38798760, 85357272, 178474296, 356948592, 686439600, 1274816400, 2294669520, 4015671660, 6850263420, 11417105700, 18627909300, 29804654880, 46835886240, 72382733280, 110147637600, 165221456400, 244527755472, 357386719536, 516225261552, 737464659360
OFFSET
0,13
REFERENCES
Charles Jordan, Calculus of Finite Differences, Chelsea 1965, p. 450.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
LINKS
Index entries for linear recurrences with constant coefficients, signature (13,-78,286,-715,1287,-1716,1716,-1287,715,-286,78,-13,1).
FORMULA
G.f.: -132*x^12 / (x-1)^13. - Colin Barker, Jul 22 2013
a(n) = 132*A010965(n). - R. J. Mathar, Jul 15 2015
MATHEMATICA
132*Binomial[Range[0, 40], 12] (* Harvey P. Dale, Feb 16 2020 *)
PROG
(Magma) [132*Binomial(n, 12):n in [0..40]]; // Vincenzo Librandi, Feb 17 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jun 10 2012. This sequence was in the 1973 "Handbook", but was later dropped from the database. I have now reinstated it. - N. J. A. Sloane, Jun 10 2012
STATUS
approved