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 A215137 #14 Aug 15 2025 02:27:27 %S A215137 1,18,35,52,69,86,103,120,137,154,171,188,205,222,239,256,273,290,307, %T A215137 324,341,358,375,392,409,426,443,460,477,494,511,528,545,562,579,596, %U A215137 613,630,647,664,681,698,715,732,749,766,783,800,817,834,851,868,885,902,919,936,953,970 %N A215137 a(n) = 17*n + 1. %H A215137 Jeremy Gardiner, <a href="/A215137/b215137.txt">Table of n, a(n) for n = 0..999</a> %H A215137 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A215137 From _G. C. Greubel_, Apr 19 2018: (Start) %F A215137 a(n) = 2*a(n-1) - a(n-2). %F A215137 G.f.: (1+16*x)/(1-x)^2. %F A215137 E.g.f.: (17*x + 1)*exp(x). (End) %t A215137 Range[1, 100, 17] %t A215137 LinearRecurrence[{2,-1}, {1,18}, 50] (* _G. C. Greubel_, Apr 19 2018 *) %o A215137 (PARI) for(n=0, 50, print1(17*n + 1, ", ")) \\ _G. C. Greubel_, Apr 19 2018 %o A215137 (Magma) I:=[1,18]; [n le 2 select I[n] else 2*Self(n-1) - Self(n-2): n in [1..30]]; // _G. C. Greubel_, Apr 19 2018 %Y A215137 Cf. A129484, A158057, A161705. %K A215137 nonn,easy %O A215137 0,2 %A A215137 _Jeremy Gardiner_, Aug 04 2012