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 A131472 #27 Oct 08 2022 22:15:18
%S A131472 0,2,66,732,4100,15630,46662,117656,262152,531450,1000010,1771572,
%T A131472 2985996,4826822,7529550,11390640,16777232,24137586,34012242,47045900,
%U A131472 64000020,85766142,113379926,148035912,191103000,244140650,308915802
%N A131472 a(n) = n^6 + n.
%H A131472 Vincenzo Librandi, <a href="/A131472/b131472.txt">Table of n, a(n) for n = 0..10000</a>
%H A131472 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (7,-21,35,-35,21,-7,1).
%F A131472 G.f.: 2*x*(1 + 26*x + 156*x^2 + 146*x^3 + 31*x^4)/(1 - x)^7. - _R. J. Mathar_, Nov 14 2007
%F A131472 a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7); a(0)=0, a(1)=2, a(2)=66, a(3)=732, a(4)=4100, a(5)=15630, a(6)=46662. - _Harvey P. Dale_, May 03 2012
%F A131472 E.g.f.: exp(x)*x*(2 + 31*x + 90*x^2 + 65*x^3 + 15*x^4 + x^5). - _Stefano Spezia_, Oct 08 2022
%t A131472 Table[n^6+n,{n,0,60}] (* _Vladimir Joseph Stephan Orlovsky_, May 12 2011 *)
%t A131472 LinearRecurrence[{7,-21,35,-35,21,-7,1},{0,2,66,732,4100,15630,46662},60] (* _Harvey P. Dale_, May 03 2012 *)
%o A131472 (Magma)[n^6+n: n in [0..30]]; // _Vincenzo Librandi+, Oct 01 2011
%Y A131472 Cf. A002378, A007531, A034262, A091940, A058895, A059826.
%K A131472 nonn,easy
%O A131472 0,2
%A A131472 _Mohammad K. Azarian_, Jul 27 2007