A017413 a(n) = 11*n + 2.

2, 13, 24, 35, 46, 57, 68, 79, 90, 101, 112, 123, 134, 145, 156, 167, 178, 189, 200, 211, 222, 233, 244, 255, 266, 277, 288, 299, 310, 321, 332, 343, 354, 365, 376, 387, 398, 409, 420, 431, 442, 453, 464, 475, 486, 497, 508, 519, 530, 541, 552, 563, 574, 585

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 G. C. Greubel, Nov 11 2018: (Start)

a(n) = 2*a(n-1) - a(n-2).

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

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

Mathematica

Range[2, 1000, 11] (* Vladimir Joseph Stephan Orlovsky, May 28 2011 *)
LinearRecurrence[{2, -1}, {2, 13}, 60] (* Harvey P. Dale, Sep 26 2020 *)

Prog

(Magma) [11*n+2: n in [0..60]]; // Vincenzo Librandi, Sep 02 2011
(PARI) a(n)=11*n+2 \\ Charles R Greathouse IV, Jul 10 2016

Crossrefs

Cf. A008593, A017401, A017425.

Sequence in context: A284516 A284651 A031038 * A194887 A230857 A263537

Adjacent sequences: A017410 A017411 A017412 * A017414 A017415 A017416

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved