Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107358
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107358 Dying rabbits: a(n) = Fibonacci(n) for n <= 12; for n >= 13, a(n)=a(n-1)+a(n-2)-a(n-13). +0
2
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 376, 608, 982, 1587, 2564, 4143, 6694, 10816, 17476, 28237, 45624, 73717, 119108, 192449, 310949, 502416, 811778, 1311630, 2119265, 3424201, 5532650, 8939375, 14443788, 23337539, 37707610, 60926041, 98441202, 159056294 (list; graph; listen)
page 1

Search completed in 0.001 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research