A017041 a(n) = 7*n + 5.

5, 12, 19, 26, 33, 40, 47, 54, 61, 68, 75, 82, 89, 96, 103, 110, 117, 124, 131, 138, 145, 152, 159, 166, 173, 180, 187, 194, 201, 208, 215, 222, 229, 236, 243, 250, 257, 264, 271, 278, 285, 292, 299, 306, 313, 320, 327, 334, 341, 348, 355, 362, 369, 376, 383

Offset

0,1

Links

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

Tanya Khovanova, Recursive Sequences

Leo Tavares, Illustration: Conjoined Triangular Frames

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

Formula

a(n) = 7*n + 5, n >= 0 (see the name).

a(n) = A125199(n+1,2) for n>0. - Reinhard Zumkeller, Nov 24 2006

G.f.: (5+2*x)/(1-x)^2 = 7*x/(1-x)^2 + 5/(1-x). - Wolfdieter Lang, Apr 10 2015

a(n) = A000326(n+2) - 3*A000217(n-1). - Leo Tavares, Sep 13 2022

E.g.f.: exp(x)*(5 + 7*x). - Stefano Spezia, Oct 10 2022

Mathematica

7*Range[0, 50]+5 (* Vladimir Joseph Stephan Orlovsky, Feb 19 2011 *)
LinearRecurrence[{2, -1}, {5, 12}, 70] (* Harvey P. Dale, Feb 08 2020 *)

Prog

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

Crossrefs

Cf. A002939, A016789, A017485, A125202, A186029.

Cf. A000326, A000217.

Sequence in context: A048926 A047704 A043413 * A139692 A099192 A047077

Adjacent sequences: A017038 A017039 A017040 * A017042 A017043 A017044

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved