A020719 a(n) = n + 7.

7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80

Offset

0,1

Comments

Pisot sequences E(7,8), P(7,8), T(7,8).

Links

Table of n, a(n) for n=0..73.

Shalosh B. Ekhad, N. J. A. Sloane and Doron Zeilberger, Automated Proof (or Disproof) of Linear Recurrences Satisfied by Pisot Sequences, arXiv preprint, arXiv:1609.05570 [math.NT], 2016.

Tanya Khovanova, Recursive Sequences.

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

Formula

a(n) = n + 7.

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

From Elmo R. Oliveira, Dec 07 2024: (Start)

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

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

Mathematica

Range[0, 80]+7 (* or *) LinearRecurrence[{2, -1}, {7, 8}, 80] (* Harvey P. Dale, Oct 29 2022 *)

Prog

(PARI) a(n)=n+7

Crossrefs

See A008776 for definitions of Pisot sequences.

Sequence in context: A195935 A363783 A168097 * A345435 A162787 A182308

Adjacent sequences: A020716 A020717 A020718 * A020720 A020721 A020722

Keyword

nonn,easy

Author

David W. Wilson

Status

approved