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 A017425 #31 Apr 03 2024 10:07:09 %S A017425 3,14,25,36,47,58,69,80,91,102,113,124,135,146,157,168,179,190,201, %T A017425 212,223,234,245,256,267,278,289,300,311,322,333,344,355,366,377,388, %U A017425 399,410,421,432,443,454,465,476,487,498,509,520,531,542,553,564,575,586 %N A017425 a(n) = 11*n + 3. %H A017425 Vincenzo Librandi, <a href="/A017425/b017425.txt">Table of n, a(n) for n = 0..10000</a> %H A017425 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a> %H A017425 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A017425 From _Elmo R. Oliveira_, Apr 03 2024: (Start) %F A017425 G.f.: (3+8*x)/(1-x)^2. %F A017425 E.g.f.: exp(x)*(3 + 11*x). %F A017425 a(n) = A226492(n+1) - A226492(n). %F A017425 a(n) = 2*a(n-1) - a(n-2) for n >= 2. (End) %t A017425 11Range[0,50]+3 (* _Harvey P. Dale_, Apr 21 2011 *) %o A017425 (Sage) [i+3 for i in range(475) if gcd(i,11) == 11] # _Zerinvary Lajos_, May 21 2009 %o A017425 (Magma) [11*n+3: n in [0..60]]; // _Vincenzo Librandi_, Sep 02 2011 %o A017425 (PARI) a(n)=11*n+3 \\ _Charles R Greathouse IV_, Jul 10 2016 %Y A017425 Cf. A008593, A017401, A017413, A226492. %K A017425 nonn,easy %O A017425 0,1 %A A017425 _N. J. A. Sloane_ %E A017425 Terms corrected by _Vincenzo Librandi_, Sep 02 2011