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 A050406 #20 Sep 08 2022 08:44:58
%S A050406 1,16,91,336,966,2352,5082,10032,18447,32032,53053,84448,129948,
%T A050406 194208,282948,403104,562989,772464,1043119,1388464,1824130,2368080,
%U A050406 3040830,3865680,4868955,6080256,7532721,9263296
%N A050406 Partial sums of A051880.
%D A050406 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
%H A050406 G. C. Greubel, <a href="/A050406/b050406.txt">Table of n, a(n) for n = 0..1000</a>
%H A050406 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1).
%F A050406 a(n) = C(n+5, 5)*(5*n + 3)/3.
%F A050406 G.f.: (1+9*x)/(1-x)^7.
%F A050406 E.g.f.: (360 +5400*x +10800*x^2 +6600*x^3 +1575*x^4 +153*x^5 +5*x^6) *exp(x)/360. - _G. C. Greubel_, Oct 30 2019
%p A050406 seq(binomial(n+5,5)*(5*n+3)/3, n=0..40); # _G. C. Greubel_, Oct 30 2019
%t A050406 Nest[Accumulate[#]&,Table[n(n+1)(10n-7)/6,{n,0,50}],3] (* _Harvey P. Dale_, Nov 13 2013 *)
%o A050406 (PARI) vector(41, n, binomial(n+4,5)*(5*n-2)/3) \\ _G. C. Greubel_, Oct 30 2019
%o A050406 (Magma) [Binomial(n+5,5)*(5*n+3)/3: n in [0..40]]; // _G. C. Greubel_, Oct 30 2019
%o A050406 (Sage) [binomial(n+5,5)*(5*n+3)/3 for n in (0..40)] # _G. C. Greubel_, Oct 30 2019
%o A050406 (GAP) List([0..40], n-> Binomial(n+5,5)*(5*n+3)/3); # _G. C. Greubel_, Oct 30 2019
%Y A050406 Cf. A051880.
%Y A050406 Cf. A093645 ((10, 1) Pascal, column m=6).
%K A050406 easy,nonn
%O A050406 0,2
%A A050406 _Barry E. Williams_, Dec 21 1999
%E A050406 Corrected by _T. D. Noe_, Nov 09 2006