This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020722 a(n) = n + 8. 0
 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(8,9), P(8,9), T(8,9). 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 Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA a(n) = n+8. a(n) = 2*a(n-1) - a(n-2). MATHEMATICA Range[0, 80]+8 (* or *) LinearRecurrence[{2, -1}, {8, 9}, 80] (* Harvey P. Dale, Jun 06 2015 *) PROG (PARI) a(n)=n+8 CROSSREFS See A008776 for definitions of Pisot sequences. Sequence in context: A004164 A004449 A168098 * A046037 A089017 A182361 Adjacent sequences:  A020719 A020720 A020721 * A020723 A020724 A020725 KEYWORD nonn,easy AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 19 19:19 EST 2018. Contains 317364 sequences. (Running on oeis4.)