cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A213380 a(n) = 132*binomial(n,12).

This page as a plain text file.
%I A213380 N2345 #25 Sep 08 2022 08:46:02
%S A213380 0,0,0,0,0,0,0,0,0,0,0,0,132,1716,12012,60060,240240,816816,2450448,
%T A213380 6651216,16628040,38798760,85357272,178474296,356948592,686439600,
%U A213380 1274816400,2294669520,4015671660,6850263420,11417105700,18627909300,29804654880,46835886240,72382733280,110147637600,165221456400,244527755472,357386719536,516225261552,737464659360
%N A213380 a(n) = 132*binomial(n,12).
%D A213380 Charles Jordan, Calculus of Finite Differences, Chelsea 1965, p. 450.
%D A213380 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%H A213380 <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (13,-78,286,-715,1287,-1716,1716,-1287,715,-286,78,-13,1).
%F A213380 G.f.: -132*x^12 / (x-1)^13. - _Colin Barker_, Jul 22 2013
%F A213380 a(n) = 132*A010965(n). - _R. J. Mathar_, Jul 15 2015
%t A213380 132*Binomial[Range[0,40],12] (* _Harvey P. Dale_, Feb 16 2020 *)
%o A213380 (Magma) [132*Binomial(n,12):n in [0..40]]; // _Vincenzo Librandi_, Feb 17 2020
%Y A213380 Cf. A010965, A000217, A034827, A000910, A088625, A088626. A column of A088617.
%K A213380 nonn,easy
%O A213380 0,13
%A A213380 _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