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 A017474 #17 Sep 08 2022 08:44:42
%S A017474 49,324,841,1600,2601,3844,5329,7056,9025,11236,13689,16384,19321,
%T A017474 22500,25921,29584,33489,37636,42025,46656,51529,56644,62001,67600,
%U A017474 73441,79524,85849,92416,99225,106276,113569,121104,128881,136900,145161,153664,162409,171396,180625,190096,199809
%N A017474 a(n) = (11*n + 7)^2.
%H A017474 Vincenzo Librandi, <a href="/A017474/b017474.txt">Table of n, a(n) for n = 0..10000</a>
%H A017474 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A017474 From _G. C. Greubel_, Sep 19 2019: (Start)
%F A017474 G.f.: (49 +177*x +16*x^2)/(1-x)^3.
%F A017474 E.g.f.: (49 +275*x +121*x^2)*exp(x). (End)
%p A017474 seq((11*n+7)^2, n=0..50); # _G. C. Greubel_, Sep 19 2019
%t A017474 (11 Range[0,50]+7)^2 (* or *) LinearRecurrence[{3,-3,1},{49,324,841},50] (* _Harvey P. Dale_, May 19 2019 *)
%o A017474 (Magma) [(11*n+7)^2: n in [0..50]]; // _Vincenzo Librandi_, Sep 04 2011
%o A017474 (PARI) a(n)=(11*n+7)^2 \\ _Charles R Greathouse IV_, Jun 17 2017
%o A017474 (Sage) [(11*n+7)^2 for n in (0..50)] # _G. C. Greubel_, Sep 19 2019
%o A017474 (GAP) List([0..50], n-> (11*n+7)^2); # _G. C. Greubel_, Sep 19 2019
%Y A017474 Powers of the form (11*n+7)^m: A017473 (m=1), this sequence (m=2), A017475 (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 A017474 nonn,easy
%O A017474 0,1
%A A017474 _N. J. A. Sloane_