A017053 a(n) = 7*n + 6.

6, 13, 20, 27, 34, 41, 48, 55, 62, 69, 76, 83, 90, 97, 104, 111, 118, 125, 132, 139, 146, 153, 160, 167, 174, 181, 188, 195, 202, 209, 216, 223, 230, 237, 244, 251, 258, 265, 272, 279, 286, 293, 300, 307, 314, 321, 328, 335, 342, 349, 356, 363, 370, 377, 384

Offset

0,1

Links

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

Tanya Khovanova, Recursive Sequences

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 955

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

Formula

a(n) = 2*a(n-1) - a(n-2). - Wesley Ivan Hurt, Mar 17 2023

G.f.: (6+x)/(1-x)^2. - Wesley Ivan Hurt, Dec 28 2023

Mathematica

Array[7*#+6&, 100, 0] (* Vladimir Joseph Stephan Orlovsky, Dec 14 2009 *)
LinearRecurrence[{2, -1}, {6, 13}, 60] (* Harvey P. Dale, Apr 13 2022 *)

Prog

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

Crossrefs

Cf. A008589, A016993, A017005, A017017.

Sequence in context: A031485 A004919 A172330 * A046040 A330177 A227359

Adjacent sequences: A017050 A017051 A017052 * A017054 A017055 A017056

Keyword

nonn,easy

Author

N. J. A. Sloane

Status

approved