Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023440
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023440 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-10). +0
1
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 88, 142, 228, 367, 590, 949, 1526, 2454, 3946, 6345, 10203, 16406, 26381, 42420, 68211, 109682, 176367, 283595, 456016, 733266, 1179079, 1895939, 3048637, 4902156, 7882582 (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: A023439 A147660 A013987 this_sequence A077373 A132634 A096275

Adjacent sequences: A023437 A023438 A023439 this_sequence A023441 A023442 A023443

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 November 27 14:17 EST 2009. Contains 167569 sequences.


AT&T Labs Research