A017425 a(n) = 11*n + 3.

3, 14, 25, 36, 47, 58, 69, 80, 91, 102, 113, 124, 135, 146, 157, 168, 179, 190, 201, 212, 223, 234, 245, 256, 267, 278, 289, 300, 311, 322, 333, 344, 355, 366, 377, 388, 399, 410, 421, 432, 443, 454, 465, 476, 487, 498, 509, 520, 531, 542, 553, 564, 575, 586

Offset

0,1

Links

Vincenzo Librandi, Table of n, a(n) for n = 0..10000

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (2,-1).

Formula

From Elmo R. Oliveira, Apr 03 2024: (Start)

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

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

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

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

Mathematica

11Range[0, 50]+3  (* Harvey P. Dale, Apr 21 2011 *)

Prog

(Sage) [i+3 for i in range(475) if gcd(i, 11) == 11] # Zerinvary Lajos, May 21 2009
(Magma) [11*n+3: n in [0..60]]; // Vincenzo Librandi, Sep 02 2011
(PARI) a(n)=11*n+3 \\ Charles R Greathouse IV, Jul 10 2016

Crossrefs

Cf. A008593, A017401, A017413, A226492.

Sequence in context: A171789 A061872 A341004 * A302758 A063098 A297433

Adjacent sequences: A017422 A017423 A017424 * A017426 A017427 A017428

Keyword

nonn,easy

Author

N. J. A. Sloane

Extensions

Terms corrected by Vincenzo Librandi, Sep 02 2011

Status

approved