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 A017413 #32 Sep 08 2022 08:44:42
%S A017413 2,13,24,35,46,57,68,79,90,101,112,123,134,145,156,167,178,189,200,
%T A017413 211,222,233,244,255,266,277,288,299,310,321,332,343,354,365,376,387,
%U A017413 398,409,420,431,442,453,464,475,486,497,508,519,530,541,552,563,574,585
%N A017413 a(n) = 11*n + 2.
%H A017413 Vincenzo Librandi, <a href="/A017413/b017413.txt">Table of n, a(n) for n = 0..10000</a>
%H A017413 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A017413 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A017413 From _G. C. Greubel_, Nov 11 2018: (Start)
%F A017413 a(n) = 2*a(n-1) - a(n-2).
%F A017413 G.f.: (2 + 9*x)/(1 - x)^2.
%F A017413 E.g.f.: (2 + 11*x)*exp(x). (End)
%t A017413 Range[2, 1000, 11] (* _Vladimir Joseph Stephan Orlovsky_, May 28 2011 *)
%t A017413 LinearRecurrence[{2,-1},{2,13},60] (* _Harvey P. Dale_, Sep 26 2020 *)
%o A017413 (Magma) [11*n+2: n in [0..60]]; // _Vincenzo Librandi_, Sep 02 2011
%o A017413 (PARI) a(n)=11*n+2 \\ _Charles R Greathouse IV_, Jul 10 2016
%Y A017413 Cf. A008593, A017401, A017425.
%K A017413 nonn,easy
%O A017413 0,1
%A A017413 _N. J. A. Sloane_