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 A017451 #16 Sep 08 2022 08:44:42 %S A017451 125,4096,19683,54872,117649,216000,357911,551368,804357,1124864, %T A017451 1520875,2000376,2571353,3241792,4019679,4913000,5929741,7077888, %U A017451 8365427,9800344,11390625,13144256,15069223,17173512,19465109,21952000,24642171,27543608,30664297,34012224,37595375,41421736 %N A017451 a(n) = (11*n + 5)^3. %H A017451 Vincenzo Librandi, <a href="/A017451/b017451.txt">Table of n, a(n) for n = 0..10000</a> %H A017451 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1). %F A017451 From _G. C. Greubel_, Sep 18 2019: (Start) %F A017451 G.f.: (125 +3596*x +4049*x^2 +216*x^3)/(1-x)^4. %F A017451 E.g.f.: (125 +3971*x +5808*x^2 +1331*x^3)*exp(x). (End) %p A017451 seq((11*n+5)^3, n=0..40); # _G. C. Greubel_, Sep 18 2019 %t A017451 (11*Range[40] -6)^3 (* _G. C. Greubel_, Sep 18 2019 *) %o A017451 (Magma) [(11*n+5)^3: n in [0..40]]; // _Vincenzo Librandi_, Sep 03 2011 %o A017451 (PARI) vector(40, n, (11*n-6)^3) \\ _G. C. Greubel_, Sep 18 2019 %o A017451 (Sage) [(11*n+5)^3 for n in (0..40)] # _G. C. Greubel_, Sep 18 2019 %o A017451 (GAP) List([0..40], n-> (11*n+5)^3); # _G. C. Greubel_, Sep 18 2019 %Y A017451 Powers of the form (11*n+5)^m: A017449 (m=1), A017450 (m=2), this sequence (m=3), A017452 (m=4), A017453 (m=5), A017454 (m=6), A017455 (m=7), A017456 (m=8), A017457 (m=9), A017458 (m=10), A017459 (m=11), A017460 (m=12). %K A017451 nonn,easy %O A017451 0,1 %A A017451 _N. J. A. Sloane_