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 A017498 #24 Sep 08 2022 08:44:42
%S A017498 81,400,961,1764,2809,4096,5625,7396,9409,11664,14161,16900,19881,
%T A017498 23104,26569,30276,34225,38416,42849,47524,52441,57600,63001,68644,
%U A017498 74529,80656,87025,93636,100489,107584,114921,122500,130321,138384,146689,155236,164025
%N A017498 a(n) = (11*n + 9)^2.
%H A017498 G. C. Greubel, <a href="/A017498/b017498.txt">Table of n, a(n) for n = 0..1000</a>
%H A017498 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A017498 a(0)=81, a(1)=400, a(2)=961, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - _Harvey P. Dale_, Oct 30 2011
%F A017498 From _G. C. Greubel_, Oct 28 2019: (Start)
%F A017498 G.f.: (81 + 157*x +4*x^2)/(1-x)^3.
%F A017498 E.g.f.: (81 + 319*x + 121*x^2)*exp(x). (End)
%p A017498 seq((11*n+9)^2, n=0..30); # _G. C. Greubel_, Oct 28 2019
%t A017498 (11Range[0,30]+9)^2 (* or *) LinearRecurrence[{3,-3,1},{81,400,961},30] (* _Harvey P. Dale_, Oct 30 2011 *)
%o A017498 (PARI) a(n)=(11*n+9)^2 \\ _Charles R Greathouse IV_, Jun 17 2017
%o A017498 (Magma) [(11*n+9)^2: n in [0..30]]; // _G. C. Greubel_, Oct 28 2019
%o A017498 (Sage) [(11*n+9)^2 for n in (0..30)] # _G. C. Greubel_, Oct 28 2019
%o A017498 (GAP) List([0..30], n-> (11*n+9)^2 ); # _G. C. Greubel_, Oct 28 2019
%Y A017498 Powers of the form (11*n+9)^m: A017497 (m=1), this sequence (m=2), A017499 (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 A017498 nonn,easy
%O A017498 0,1
%A A017498 _N. J. A. Sloane_