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 A017476 #18 Sep 08 2022 08:44:42
%S A017476 2401,104976,707281,2560000,6765201,14776336,28398241,49787136,
%T A017476 81450625,126247696,187388721,268435456,373301041,506250000,671898241,
%U A017476 875213056,1121513121,1416468496,1766100625,2176782336,2655237841,3208542736,3844124001,4569760000
%N A017476 a(n) = (11*n + 7)^4.
%H A017476 Vincenzo Librandi, <a href="/A017476/b017476.txt">Table of n, a(n) for n = 0..10000</a>
%H A017476 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).
%F A017476 a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5); a(0)=2401, a(1)=104976, a(2)=707281, a(3)=2560000, a(4)=6765201. - _Harvey P. Dale_, Oct 21 2015
%F A017476 From _G. C. Greubel_, Sep 19 2019: (Start)
%F A017476 G.f.: (2401 +92971*x +206411*x^2 +49345*x^3 +256*x^4)/(1-x)^5.
%F A017476 E.g.f.: (2401 +102575*x +249865*x^2 +125114*x^3 +14641 x^4)*exp(x). (End)
%p A017476 seq((11*n+7)^4, n=0..30); # _G. C. Greubel_, Sep 19 2019
%t A017476 (11*Range[0,30]+7)^4 (* or *) LinearRecurrence[{5,-10,10,-5,1}, {2401, 104976,707281,2560000,6765201}, 30] (* _Harvey P. Dale_, Oct 21 2015 *)
%o A017476 (Magma) [(11*n+7)^4: n in [0..30]]; // _Vincenzo Librandi_, Sep 04 2011
%o A017476 (PARI) vector(30, n, (11*n-4)^4) \\ _G. C. Greubel_, Sep 19 2019
%o A017476 (Sage) [(11*n+7)^4 for n in (0..30)] # _G. C. Greubel_, Sep 19 2019
%o A017476 (GAP) List([0..30], n-> (11*n+7)^4); # _G. C. Greubel_, Sep 19 2019
%Y A017476 Powers of the form (11*n+7)^m: A017473 (m=1), A017474 (m=2), A017475 (m=3), this sequence (m=4), A017477 (m=5), A017478 (m=6), A017479 (m=7), A017480 (m=8), A017481 (m=9), A017482 (m=10), A017483 (m=11), A017484 (m=12).
%K A017476 nonn,easy
%O A017476 0,1
%A A017476 _N. J. A. Sloane_