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 A017475 #27 Sep 08 2022 08:44:42
%S A017475 343,5832,24389,64000,132651,238328,389017,592704,857375,1191016,
%T A017475 1601613,2097152,2685619,3375000,4173281,5088448,6128487,7301384,
%U A017475 8615125,10077696,11697083,13481272,15438249,17576000,19902511,22425768,25153757,28094464,31255875,34645976,38272753,42144192
%N A017475 a(n) = (11*n + 7)^3.
%H A017475 Vincenzo Librandi, <a href="/A017475/b017475.txt">Table of n, a(n) for n = 0..10000</a>
%H A017475 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A017475 G.f.: (343 + 4460*x + 3119*x^2 + 64*x^3)/(1-x)^4. - _R. J. Mathar_, Jun 24 2009
%F A017475 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4); a(0)=343, a(1)=5832, a(2)=24389, a(3)=64000. - _Harvey P. Dale_, Oct 18 2014
%F A017475 E.g.f.: (343 +5489*x +6534*x^2 +1331*x^3)*exp(x). - _G. C. Greubel_, Sep 19 2019
%p A017475 seq((11*n+7)^3, n=0..40); # _G. C. Greubel_, Sep 19 2019
%t A017475 (11*Range[0,40]+7)^3 (* or *) LinearRecurrence[{4,-6,4,-1},{343,5832, 24389,64000}, 40] (* _Harvey P. Dale_, Oct 18 2014 *)
%o A017475 (Magma) [(11*n+7)^3: n in [0..40]]; // _Vincenzo Librandi_, Sep 04 2011
%o A017475 (Maxima) makelist((11*n+7)^3, n,0,40); /* _Martin Ettl_, Oct 21 2012 */
%o A017475 (PARI) a(n) = (11*n+7)^3; \\ _Altug Alkan_, Sep 08 2018
%o A017475 (Sage) [(11*n+7)^3 for n in (0..40)] # _G. C. Greubel_, Sep 19 2019
%o A017475 (GAP) List([0..40], n-> (11*n+7)^3); # _G. C. Greubel_, Sep 19 2019
%Y A017475 Powers of the form (11*n+7)^m: A017473 (m=1), A017474 (m=2), this sequence (m=3), A017476 (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 A017475 nonn,easy
%O A017475 0,1
%A A017475 _N. J. A. Sloane_