A017449 a(n) = 11*n + 5.

5, 16, 27, 38, 49, 60, 71, 82, 93, 104, 115, 126, 137, 148, 159, 170, 181, 192, 203, 214, 225, 236, 247, 258, 269, 280, 291, 302, 313, 324, 335, 346, 357, 368, 379, 390, 401, 412, 423, 434, 445, 456, 467, 478, 489, 500, 511, 522, 533, 544, 555, 566, 577, 588

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, Sep 18 2019: (Start)

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

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

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

Maple

seq(11*n+5, n=0..60); # G. C. Greubel, Sep 18 2019

Mathematica

Range[5, 1000, 11] (* Vladimir Joseph Stephan Orlovsky, May 28 2011 *)
LinearRecurrence[{2, -1}, {5, 16}, 60] (* Harvey P. Dale, Apr 15 2019 *)

Prog

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

Crossrefs

Cf. A008593, A017401, A017437.

Powers of the form (11*n+5)^m: this sequence (m=1), A017450 (m=2), A017451 (m=3), A017452 (m=4), A017453 (m=5), A017454 (m=6), A017455 (m=7), A017456 (m=8), A017457 (m=9), A017458 (m=10), A017459 (m=11), A017460 (m=12).

Sequence in context: A018197 A061874 A341006 * A056736 A063236 A063228

Adjacent sequences: A017446 A017447 A017448 * A017450 A017451 A017452

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved