Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023437
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023437 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-7). +0
2
0, 1, 1, 2, 3, 5, 8, 13, 20, 32, 50, 79, 124, 195, 306, 481, 755, 1186, 1862, 2924, 4591, 7209, 11319, 17773, 27906, 43817, 68799, 108025, 169615, 266321, 418163, 656578, 1030924, 1618703, 2541602, 3990690 (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.

FORMULA

G.f.: x/((x-1)*(1+x)*(x^5+x^3+x-1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 27 2009]

CROSSREFS

See A000045 for the Fibonacci numbers.

First differences are in A013983.

Sequence in context: A156145 A059923 A055805 this_sequence A013985 A092834 A080106

Adjacent sequences: A023434 A023435 A023436 this_sequence A023438 A023439 A023440

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 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research