Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023442
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023442 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-12). +0
1
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 232, 375, 605, 977, 1577, 2546, 4110, 6635, 10711, 17291, 27913, 45060, 72741, 117426, 189562, 306011, 493996, 797461, 1287347, 2078173, 3354809, 5415691, 8742587 (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: A093091 A105471 A023441 this_sequence A000044 A107358 A132636

Adjacent sequences: A023439 A023440 A023441 this_sequence A023443 A023444 A023445

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research