login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A239096 (n^9 + 21*n^5 - 190*n^3 + 168*n)/1260. 2

%I #15 Sep 08 2022 08:46:07

%S 0,0,0,16,216,1584,8096,32256,106992,308352,795168,1873872,4098952,

%T 8422128,16406208,30522752,54556128,94140288,157458624,256141584,

%U 406401336,630447664,958234464,1429591680,2096803280,3027697920,4309325280,6052297680,8395883496,11513946096,15621829504,20984299776,27924659136,36835158272,48188840832

%N (n^9 + 21*n^5 - 190*n^3 + 168*n)/1260.

%H Vincenzo Librandi, <a href="/A239096/b239096.txt">Table of n, a(n) for n = 0..1000</a>

%H C. P. Neuman and D. I. Schonbach, <a href="http://dx.doi.org/10.1137/1019006">Evaluation of sums of convolved powers using Bernoulli numbers</a>, SIAM Rev. 19 (1977), no. 1, 90--99. MR0428678 (55 #1698). See Table 3.

%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (10,-45,120,-210,252,-210,120,-45,10,-1).

%F G.f.: 8*x^3*(2 + 7*x + 18*x^2 + 7*x^3 + 2*x^4)/(1 - x)^10. [_Bruno Berselli_, May 12 2014]

%F a(n) = (n - 2)*(n - 1)*n*(n + 1)*(n + 2)*(n^4 + 5*n^2 + 42)/1260. [_Bruno Berselli_, May 12 2014]

%t Table[(n^9 + 21 n^5 - 190 n^3 + 168 n)/1260, {n, 0, 50}] (* _Vincenzo Librandi_, Mar 24 2014 *)

%o (Magma) [(n^9+21*n^5-190*n^3+168*n)/1260: n in [0..40]]; // _Vincenzo Librandi_, Mar 24 2014

%K nonn,easy

%O 0,4

%A _N. J. A. Sloane_, Mar 23 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 08:48 EDT 2024. Contains 371930 sequences. (Running on oeis4.)