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.
%I A239096 #15 Sep 08 2022 08:46:07
%S A239096 0,0,0,16,216,1584,8096,32256,106992,308352,795168,1873872,4098952,
%T A239096 8422128,16406208,30522752,54556128,94140288,157458624,256141584,
%U A239096 406401336,630447664,958234464,1429591680,2096803280,3027697920,4309325280,6052297680,8395883496,11513946096,15621829504,20984299776,27924659136,36835158272,48188840832
%N A239096 (n^9 + 21*n^5 - 190*n^3 + 168*n)/1260.
%H A239096 Vincenzo Librandi, <a href="/A239096/b239096.txt">Table of n, a(n) for n = 0..1000</a>
%H A239096 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 A239096 <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 A239096 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 A239096 a(n) = (n - 2)*(n - 1)*n*(n + 1)*(n + 2)*(n^4 + 5*n^2 + 42)/1260. [_Bruno Berselli_, May 12 2014]
%t A239096 Table[(n^9 + 21 n^5 - 190 n^3 + 168 n)/1260, {n, 0, 50}] (* _Vincenzo Librandi_, Mar 24 2014 *)
%o A239096 (Magma) [(n^9+21*n^5-190*n^3+168*n)/1260: n in [0..40]]; // _Vincenzo Librandi_, Mar 24 2014
%K A239096 nonn,easy
%O A239096 0,4
%A A239096 _N. J. A. Sloane_, Mar 23 2014