A017497 a(n) = 11*n + 9.

9, 20, 31, 42, 53, 64, 75, 86, 97, 108, 119, 130, 141, 152, 163, 174, 185, 196, 207, 218, 229, 240, 251, 262, 273, 284, 295, 306, 317, 328, 339, 350, 361, 372, 383, 394, 405, 416, 427, 438, 449, 460, 471, 482, 493, 504, 515, 526, 537, 548, 559, 570, 581, 592

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, Oct 28 2019: (Start)

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

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

Maple

seq(11*n+9, n=0..60); # G. C. Greubel, Oct 28 2019

Mathematica

Range[9, 1000, 11] (* Vladimir Joseph Stephan Orlovsky, May 29 2011 *)
(11*Range[60] - 2) (* G. C. Greubel, Oct 28 2019 *)

Prog

(Magma) [11*n+9: n in [0..60]]; // Vincenzo Librandi, Sep 18 2011
(PARI) a(n)=11*n+9 \\ Charles R Greathouse IV, Jul 10 2016
(Sage) [11*n+9 for n in (0..60)] # G. C. Greubel, Oct 28 2019
(GAP) List([0..60], n-> 11*n+9); # G. C. Greubel, Oct 28 2019

Crossrefs

Cf. A008593, A017401, A017413.

Powers of the form (11*n+9)^m: this sequence (m=1), A017498 (m=2), A017499 (m=3), A017500 (m=4), A017501 (m=5), A017502 (m=6), A017503 (m=7), A017504 (m=8), A017505 (m=9), A017506 (m=10), A017607 (m=11), A017508 (m=12).

Sequence in context: A253089 A256383 A322433 * A059108 A028566 A147479

Adjacent sequences: A017494 A017495 A017496 * A017498 A017499 A017500

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved