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 A101862 #18 Sep 08 2022 08:45:16
%S A101862 24,108,302,671,1296,2275,3724,5778,8592,12342,17226,23465,31304,
%T A101862 41013,52888,67252,84456,104880,128934,157059,189728,227447,270756,
%U A101862 320230,376480,440154,511938,592557,682776,783401,895280,1019304,1156408,1307572,1473822,1656231
%N A101862 a(n) = n*(n+1)*(n+7)*(122+57*n+n^2)/120.
%C A101862 Partial sums of A101861.
%C A101862 6th partial summation within series as series accumulate n times from an initial sequence of Euler Triangle's row 4: 1,11,11,1: 6th row of the array in the examples of A101860.
%H A101862 C. Rossiter, <a href="http://noticingnumbers.net/300SeriesCube.htm">Depictions, Explorations and Formulas of the Euler/Pascal Cube</a>.
%H A101862 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (6,-15,20,-15,6,-1).
%F A101862 G.f.: x*(2-x)*(x^2-12*x+12) / (1-x)^6. - _R. J. Mathar_, Dec 06 2011
%F A101862 a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n > 6. - _Wesley Ivan Hurt_, Dec 06 2016
%p A101862 A101862:=n->n*(n+1)*(n+7)*(122+57*n+n^2)/120: seq(A101862(n), n=1..50); # _Wesley Ivan Hurt_, Dec 06 2016
%t A101862 Table[n*(n + 1)*(n + 7)*(122 + 57*n + n^2)/120, {n, 50}] (* _Wesley Ivan Hurt_, Dec 06 2016 *)
%t A101862 LinearRecurrence[{6,-15,20,-15,6,-1},{24,108,302,671,1296,2275},50] (* _Harvey P. Dale_, Oct 15 2020 *)
%o A101862 (Magma) [n*(n + 1)*(n + 7)*(122 + 57*n + n^2)/120 : n in [1..50]]; // _Wesley Ivan Hurt_, Dec 06 2016
%Y A101862 Cf. A101860, A101861.
%K A101862 nonn,easy
%O A101862 1,1
%A A101862 Cecilia Rossiter (cecilia(AT)noticingnumbers.net), Dec 18 2004