Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023438
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023438 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-8). +0
1
0, 1, 1, 2, 3, 5, 8, 13, 21, 33, 53, 84, 134, 213, 339, 539, 857, 1363, 2167, 3446, 5479, 8712, 13852, 22025, 35020, 55682, 88535, 140771, 223827, 355886, 565861, 899722, 1430563, 2274603, 3616631, 5750463 (list; graph; listen)
OFFSET

0,4

REFERENCES

J. H. E. Cohn, Letter to the editor, Fib. Quart. 2 (1964), 108.

V. E. Hoggatt, Jr., and D. A. Lind, The dying rabbit problem, Fib. Quart. 7 (1969), 482-487.

CROSSREFS

See A000045 for the Fibonacci numbers.

Sequence in context: A048817 A011185 A055806 this_sequence A117760 A111917 A013986

Adjacent sequences: A023435 A023436 A023437 this_sequence A023439 A023440 A023441

KEYWORD

nonn

AUTHOR

njas

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research