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 A107253 #36 Sep 08 2022 08:45:18
%S A107253 1,1,51,211,565,1221,2311,3991,6441,9865,14491,20571,28381,38221,
%T A107253 50415,65311,83281,104721,130051,159715,194181,233941,279511,331431,
%U A107253 390265,456601,531051,614251,706861,809565,923071,1048111,1185441,1335841
%N A107253 a(n) = n^4 - 15*n + 15.
%C A107253 a(n) == A109009(n) (mod 10). - _Michel Marcus_, Sep 05 2013
%H A107253 Vincenzo Librandi, <a href="/A107253/b107253.txt">Table of n, a(n) for n = 1..1000</a>
%H A107253 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).
%F A107253 G.f.: x*(1-4*x+56*x^2-44*x^3+15*x^4)/(1-x)^5. - _Vincenzo Librandi_, Sep 06 2013
%e A107253 a(2) = 2^4 - 15*2 + 15 = 1;
%e A107253 a(4) = 4^4 - 15*4 + 15 = 211.
%t A107253 Table[(n^4 - 15 n + 15), {n, 1, 40}] (* _Vincenzo Librandi_, Sep 06 2013 *)
%t A107253 LinearRecurrence[{5,-10,10,-5,1},{1,1,51,211,565},40] (* _Harvey P. Dale_, Nov 23 2019 *)
%o A107253 (PARI) a(n) = n^4 - 15*n + 15; \\ _Michel Marcus_, Sep 05 2013
%o A107253 (Magma) [n^4 - 15*n + 15: n in [1..40]]; // _Vincenzo Librandi_, Sep 06 2013
%K A107253 nonn,easy
%O A107253 1,3
%A A107253 Andras Erszegi (erszegi.andras(AT)chello.hu), May 14 2005
%E A107253 Definition clarified by _Ralf Stephan_, Nov 18 2010.