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 A017365 #30 Apr 04 2025 14:31:35
%S A017365 8,18,28,38,48,58,68,78,88,98,108,118,128,138,148,158,168,178,188,198,
%T A017365 208,218,228,238,248,258,268,278,288,298,308,318,328,338,348,358,368,
%U A017365 378,388,398,408,418,428,438,448,458,468,478,488,498,508,518,528,538
%N A017365 a(n) = 10*n + 8.
%H A017365 Vincenzo Librandi, <a href="/A017365/b017365.txt">Table of n, a(n) for n = 0..5000</a>
%H A017365 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A017365 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A017365 a(n) = 2*a(n-1) - a(n-2). - _Vincenzo Librandi_, May 29 2011
%F A017365 From _R. J. Mathar_, Nov 26 2014: (Start)
%F A017365 G.f.: 2*(4+x)/(x-1)^2.
%F A017365 a(n) = 2*A016897(n). (End)
%F A017365 From _Elmo R. Oliveira_, Apr 04 2025: (Start)
%F A017365 E.g.f.: 2*exp(x)*(4 + 5*x).
%F A017365 a(n) = A016885(2*n+1). (End)
%t A017365 Range[8, 1000, 10] (* _Vladimir Joseph Stephan Orlovsky_, May 28 2011 *)
%t A017365 LinearRecurrence[{2,-1},{8,18},60] (* _Harvey P. Dale_, Aug 31 2015 *)
%o A017365 (Magma) [10*n+8: n in [0..60]]; // _Vincenzo Librandi_, May 29 2011
%Y A017365 Cf. A016885, A016897.
%K A017365 nonn,easy
%O A017365 0,1
%A A017365 _N. J. A. Sloane_