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 A017500 #14 Sep 08 2022 08:44:42 %S A017500 6561,160000,923521,3111696,7890481,16777216,31640625,54700816, %T A017500 88529281,136048896,200533921,285610000,395254161,533794816,705911761, %U A017500 916636176,1171350625,1475789056,1836036801,2258530576,2750058481,3317760000,3969126001,4711998736 %N A017500 a(n) = (11*n + 9)^4. %H A017500 G. C. Greubel, <a href="/A017500/b017500.txt">Table of n, a(n) for n = 0..1000</a> %H A017500 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1). %F A017500 From _G. C. Greubel_, Oct 28 2019: (Start) %F A017500 G.f.: (6561 +127195*x +189131*x^2 +28481*x^3 +16*x^4)/(1-x)^5. %F A017500 E.g.f.: (6561 +153439*x +305041*x^2 +135762*x^3 +14641*x^4)*exp(x). (End) %p A017500 seq((11*n+9)^4, n=0..30); # _G. C. Greubel_, Oct 28 2019 %t A017500 (11Range[0,20]+9)^4 (* _Harvey P. Dale_, Mar 27 2011 *) %o A017500 (PARI) vector(31, n, (11*n-2)^3) \\ _G. C. Greubel_, Oct 28 2019 %o A017500 (Magma) [(11*n+9)^3: n in [0..30]]; // _G. C. Greubel_, Oct 28 2019 %o A017500 (Sage) [(11*n+9)^3 for n in (0..30)] # _G. C. Greubel_, Oct 28 2019 %o A017500 (GAP) List([0..30], n-> (11*n+9)^3); # _G. C. Greubel_, Oct 28 2019 %Y A017500 Powers of the form (11*n+9)^m: A017497 (m=1), A017498 (m=2), A017499 (m=3), this sequence (m=4), A017501 (m=5), A017502 (m=6), A017503 (m=7), A017504 (m=8), A017505 (m=9), A017506 (m=10), A017607 (m=11), A017508 (m=12). %K A017500 nonn,easy %O A017500 0,1 %A A017500 _N. J. A. Sloane_