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 A017053 #37 Dec 28 2023 22:06:27
%S A017053 6,13,20,27,34,41,48,55,62,69,76,83,90,97,104,111,118,125,132,139,146,
%T A017053 153,160,167,174,181,188,195,202,209,216,223,230,237,244,251,258,265,
%U A017053 272,279,286,293,300,307,314,321,328,335,342,349,356,363,370,377,384
%N A017053 a(n) = 7*n + 6.
%H A017053 Vincenzo Librandi, <a href="/A017053/b017053.txt">Table of n, a(n) for n = 0..5000</a>
%H A017053 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A017053 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=955">Encyclopedia of Combinatorial Structures 955</a>
%H A017053 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A017053 a(n) = 2*a(n-1) - a(n-2). - _Wesley Ivan Hurt_, Mar 17 2023
%F A017053 G.f.: (6+x)/(1-x)^2. - _Wesley Ivan Hurt_, Dec 28 2023
%t A017053 Array[7*#+6&,100,0] (* _Vladimir Joseph Stephan Orlovsky_, Dec 14 2009 *)
%t A017053 LinearRecurrence[{2,-1},{6,13},60] (* _Harvey P. Dale_, Apr 13 2022 *)
%o A017053 (Magma) [7*n + 6: n in [0..60]]; // _Vincenzo Librandi_, Jun 18 2011
%o A017053 (PARI) a(n)=7*n+6 \\ _Charles R Greathouse IV_, Jul 10 2016
%Y A017053 Cf. A008589, A016993, A017005, A017017.
%K A017053 nonn,easy
%O A017053 0,1
%A A017053 _N. J. A. Sloane_