A017425 - OEIS

%I #31 Apr 03 2024 10:07:09

%S 3,14,25,36,47,58,69,80,91,102,113,124,135,146,157,168,179,190,201,

%T 212,223,234,245,256,267,278,289,300,311,322,333,344,355,366,377,388,

%U 399,410,421,432,443,454,465,476,487,498,509,520,531,542,553,564,575,586

%N a(n) = 11*n + 3.

%H Vincenzo Librandi, <a href="/A017425/b017425.txt">Table of n, a(n) for n = 0..10000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F From _Elmo R. Oliveira_, Apr 03 2024: (Start)

%F G.f.: (3+8*x)/(1-x)^2.

%F E.g.f.: exp(x)*(3 + 11*x).

%F a(n) = A226492(n+1) - A226492(n).

%F a(n) = 2*a(n-1) - a(n-2) for n >= 2. (End)

%t 11Range[0,50]+3  (* _Harvey P. Dale_, Apr 21 2011 *)

%o (Sage) [i+3 for i in range(475) if gcd(i,11) == 11] # _Zerinvary Lajos_, May 21 2009

%o (Magma) [11*n+3: n in [0..60]]; // _Vincenzo Librandi_, Sep 02 2011

%o (PARI) a(n)=11*n+3 \\ _Charles R Greathouse IV_, Jul 10 2016

%Y Cf. A008593, A017401, A017413, A226492.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

%E Terms corrected by _Vincenzo Librandi_, Sep 02 2011