A020710 a(n) = n + 5.

5, 6, 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

Offset

0,1

Comments

Pisot sequences E(5,6), P(5,6), T(5,6).

Links

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

Tanya Khovanova, Recursive Sequences.

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

Formula

a(n) = n + 5.

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

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

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

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

Mathematica

Range[0, 80]+5 (* Harvey P. Dale, Oct 12 2016 *)

Prog

(PARI) a(n)=n+5

Crossrefs

See A008776 for definitions of Pisot sequences.

Sequence in context: A163508 A168095 A030541 * A101107 A296603 A268541

Adjacent sequences: A020707 A020708 A020709 * A020711 A020712 A020713

Keyword

nonn,easy

Author

David W. Wilson

Status

approved