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 A131466 #15 Oct 21 2022 21:23:34
%S A131466 1,3,57,319,1065,2691,5713,10767,18609,30115,46281,68223,97177,134499,
%T A131466 181665,240271,312033,398787,502489,625215,769161,936643,1130097,
%U A131466 1352079,1605265,1892451,2216553,2580607,2987769,3441315
%N A131466 a(n) = 5n^4 - 4n^3 + 3n^2 - 2n + 1.
%H A131466 Harvey P. Dale, <a href="/A131466/b131466.txt">Table of n, a(n) for n = 0..1000</a>
%H A131466 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5, -10, 10, -5, 1).
%F A131466 From _Chai Wah Wu_, Nov 13 2018: (Start)
%F A131466 a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n > 4.
%F A131466 G.f.: (-15*x^4 - 54*x^3 - 52*x^2 + 2*x - 1)/(x - 1)^5. (End)
%t A131466 Table[5n^4-4n^3+3n^2-2n+1,{n,0,30}] (* or *) LinearRecurrence[{5,-10,10,-5,1},{1,3,57,319,1065},30] (* _Harvey P. Dale_, Nov 01 2020 *)
%o A131466 (PARI) a(n)=5*n^4-4*n^3+3*n^2-2*n+1 \\ _Charles R Greathouse IV_, Oct 21 2022
%Y A131466 Cf. A084849, A056109, A056105, A056578, A056579.
%K A131466 nonn,easy
%O A131466 0,2
%A A131466 _Mohammad K. Azarian_, Jul 26 2007