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 A017499 #20 Sep 08 2022 08:44:42
%S A017499 729,8000,29791,74088,148877,262144,421875,636056,912673,1259712,
%T A017499 1685159,2197000,2803221,3511808,4330747,5268024,6331625,7529536,
%U A017499 8869743,10360232,12008989,13824000,15813251,17984728,20346417,22906304,25672375,28652616,31855013
%N A017499 a(n) = (11*n + 9)^3.
%H A017499 G. C. Greubel, <a href="/A017499/b017499.txt">Table of n, a(n) for n = 0..1000</a>
%H A017499 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A017499 From _G. C. Greubel_, Oct 28 2019: (Start)
%F A017499 G.f.: (729 + 5084*x + 2165*x^2 + 8*x^3)/(1-x)^4.
%F A017499 E.g.f.: (729 + 7271*x + 7260*x^2 + 1331*x^3)*exp(x). (End)
%p A017499 seq((11*n+9)^3, n=0..30); # _G. C. Greubel_, Oct 28 2019
%t A017499 (11 Range[0,30]+9)^3 (* or *) LinearRecurrence[{4,-6,4,-1},{729,8000,29791,74088},30] (* _Harvey P. Dale_, Feb 13 2018 *)
%o A017499 (Maxima) makelist( (11*n+9)^3, n, 0, 30); /* _Martin Ettl_, Oct 21 2012 */
%o A017499 (PARI) vector(31, n, (11*n-2)^3) \\ _G. C. Greubel_, Oct 28 2019
%o A017499 (Magma) [(11*n+9)^3: n in [0..30]]; // _G. C. Greubel_, Oct 28 2019
%o A017499 (Sage) [(11*n+9)^3 for n in (0..30)] # _G. C. Greubel_, Oct 28 2019
%o A017499 (GAP) List([0..30], n-> (11*n+9)^3); # _G. C. Greubel_, Oct 28 2019
%Y A017499 Powers of the form (11*n+9)^m: A017497 (m=1), A017498 (m=2), this sequence (m=3), A017500 (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 A017499 nonn,easy
%O A017499 0,1
%A A017499 _N. J. A. Sloane_