Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020695
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020695 Pisot sequence E(2,3). +0
4
2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986, 102334155, 165580141 (list; graph; listen)
OFFSET

0,1

LINKS

Tanya Khovanova, Recursive Sequences

FORMULA

a(n) = Fib(n+3); a(n) = a(n-1) + a(n-2).

CROSSREFS

Subsequence of A000045. See A008776 for definitions of Pisot sequences.

See A000045 for the Fibonacci numbers.

Adjacent sequences: A020692 A020693 A020694 this_sequence A020696 A020697 A020698

Sequence in context: A039834 A000045 A134805 this_sequence A132916 A069041 A109609

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 8 18:01 EDT 2008. Contains 139605 sequences.


AT&T Labs Research