This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020723 n+9. 0
 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, 81 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Pisot sequences E(9,10), P(9,10), T(9,10). 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+9. a(n) = 2a(n-1) - a(n-2). PROG (PARI) a(n)=n+9 CROSSREFS See A008776 for definitions of Pisot sequences. Sequence in context: A168099 A004498 A171892 * A317591 A107043 A182362 Adjacent sequences:  A020720 A020721 A020722 * A020724 A020725 A020726 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 13 17:45 EST 2018. Contains 317149 sequences. (Running on oeis4.)