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 A017041 #48 Oct 24 2022 00:06:31
%S A017041 5,12,19,26,33,40,47,54,61,68,75,82,89,96,103,110,117,124,131,138,145,
%T A017041 152,159,166,173,180,187,194,201,208,215,222,229,236,243,250,257,264,
%U A017041 271,278,285,292,299,306,313,320,327,334,341,348,355,362,369,376,383
%N A017041 a(n) = 7*n + 5.
%H A017041 Vincenzo Librandi, <a href="/A017041/b017041.txt">Table of n, a(n) for n = 0..5000</a>
%H A017041 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A017041 Leo Tavares, <a href="/A017041/a017041_1.jpg">Illustration: Conjoined Triangular Frames</a>
%H A017041 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A017041 a(n) = 7*n + 5, n >= 0 (see the name).
%F A017041 a(n) = A125199(n+1,2) for n>0. - _Reinhard Zumkeller_, Nov 24 2006
%F A017041 G.f.: (5+2*x)/(1-x)^2 = 7*x/(1-x)^2 + 5/(1-x). - _Wolfdieter Lang_, Apr 10 2015
%F A017041 a(n) = A000326(n+2) - 3*A000217(n-1). - _Leo Tavares_, Sep 13 2022
%F A017041 E.g.f.: exp(x)*(5 + 7*x). - _Stefano Spezia_, Oct 10 2022
%t A017041 7*Range[0,50]+5 (* _Vladimir Joseph Stephan Orlovsky_, Feb 19 2011 *)
%t A017041 LinearRecurrence[{2,-1},{5,12},70] (* _Harvey P. Dale_, Feb 08 2020 *)
%o A017041 (Magma) [7*n+5: n in [0..60]]; // _Vincenzo Librandi_, Jul 10 2011
%o A017041 (PARI) a(n)=7*n+5 \\ _Charles R Greathouse IV_, Jul 10 2016
%Y A017041 Cf. A002939, A016789, A017485, A125202, A186029.
%Y A017041 Cf. A000326, A000217.
%K A017041 nonn,easy
%O A017041 0,1
%A A017041 _N. J. A. Sloane_