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 A017488 #16 Sep 08 2022 08:44:42 %S A017488 4096,130321,810000,2825761,7311616,15752961,29986576,52200625, %T A017488 84934656,131079601,193877776,276922881,384160000,519885601,688747536, %U A017488 895745041,1146228736,1445900625,1800814096,2217373921,2702336256,3262808641,3906250000,4640470641 %N A017488 a(n) = (11*n + 8)^4. %H A017488 Vincenzo Librandi, <a href="/A017488/b017488.txt">Table of n, a(n) for n = 0..10000</a> %H A017488 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1). %F A017488 From _G. C. Greubel_, Sep 22 2019: (Start) %F A017488 G.f.: (4096 + 109841*x + 199355*x^2 + 38011*x^3 + 81*x^4)/(1-x)^5. %F A017488 E.g.f.: (4096 +126225*x +276727*x^2 +130438*x^3 +14641*x^4)*exp(x). (End) %p A017488 seq((11*n+8)^4, n=0..30); # _G. C. Greubel_, Sep 22 2019 %t A017488 (11*Range[31] -3)^4 (* _G. C. Greubel_, Sep 22 2019 *) %o A017488 (Magma) [(11*n+8)^4: n in [0..30]]; // _Vincenzo Librandi_, Sep 04 2011 %o A017488 (PARI) vector(30, n, (11*n-3)^4) \\ _G. C. Greubel_, Sep 22 2019 %o A017488 (Sage) [(11*n+8)^4 for n in (0..30)] # _G. C. Greubel_, Sep 22 2019 %o A017488 (GAP) List([0..30], n-> (11*n+8)^4); # _G. C. Greubel_, Sep 22 2019 %Y A017488 Powers of the form (11*n+8)^m: A017485 (m=1), A017486 (m=2), A017487 (m=3), this sequence (m=4), A017489 (m=5), A017490 (m=6), A017491 (m=7), A017492 (m=8), A017493 (m=9), A017494 (m=10), A017495 (m=11), A017496 (m=12). %K A017488 nonn,easy %O A017488 0,1 %A A017488 _N. J. A. Sloane_