
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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

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


REFERENCES

Shalosh B. Ekhad, N. J. A. Sloane and Doron Zeilberger, Automated Proof (or Disproof) of Linear Recurrences Satisfied by Pisot Sequences, Preprint, 2016.


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+7.
a(n) = 2*a(n1)  a(n2).


PROG

(PARI) a(n)=n+7


CROSSREFS

See A008776 for definitions of Pisot sequences.
Sequence in context: A006969 A195935 A168097 * A162787 A182308 A023388
Adjacent sequences: A020716 A020717 A020718 * A020720 A020721 A020722


KEYWORD

nonn,easy


AUTHOR

David W. Wilson


STATUS

approved

