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 A017005 #39 Sep 08 2022 08:44:41
%S A017005 2,9,16,23,30,37,44,51,58,65,72,79,86,93,100,107,114,121,128,135,142,
%T A017005 149,156,163,170,177,184,191,198,205,212,219,226,233,240,247,254,261,
%U A017005 268,275,282,289,296,303,310,317,324,331,338,345,352,359,366,373,380
%N A017005 a(n) = 7n + 2.
%H A017005 Vincenzo Librandi, <a href="/A017005/b017005.txt">Table of n, a(n) for n = 0..1120</a>
%H A017005 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A017005 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A017005 G.f.: (2+5*x)/(1-x)^2.
%F A017005 E.g.f.: exp(x)*(2 + 7*x). - _Stefano Spezia_, Mar 21 2021
%F A017005 a(n) = 2*a(n-1) - a(n-2). - _Wesley Ivan Hurt_, Mar 22 2021
%t A017005 Range[2, 1000, 7] (* _Vladimir Joseph Stephan Orlovsky_, May 27 2011 *)
%t A017005 LinearRecurrence[{2,-1},{2,9},60] (* _Harvey P. Dale_, Sep 07 2015 *)
%o A017005 (Magma) [ 7*n+2: n in [0..60] ];
%Y A017005 Cf. A008589, A016993, A342758.
%K A017005 nonn,easy
%O A017005 0,1
%A A017005 _N. J. A. Sloane_