Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023441
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A023441
%S A023441 0,1,1,2,3,5,8,13,21,34,55,89,143,231,372,600,967,1559,
%T A023441 2513,4051,6530,10526,16967,27350,44086,71064,114550,184647,
%U A023441 297638,479772,773359,1246601,2009434,3239068,5221152,8416134
%N A023441 Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-11).
%D A023441 J. H. E. Cohn, Letter to the editor, Fib. Quart. 2 (1964), 108.
%D A023441 V. E. Hoggatt, Jr. and D. A. Lind, The dying rabbit problem, Fib. Quart. 
               7 (1969), 482-487.
%F A023441 G.f.: x/((x-1)*(1+x)*(x^9+x^7+x^5+x^3+x-1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Jul 27 2009]
%Y A023441 See A000045 for the Fibonacci numbers.
%Y A023441 Sequence in context: A093089 A093091 A105471 this_sequence A023442 A000044 
               A107358
%Y A023441 Adjacent sequences: A023438 A023439 A023440 this_sequence A023442 A023443 
               A023444
%K A023441 nonn
%O A023441 0,4
%A A023441 N. J. A. Sloane (njas(AT)research.att.com).

    
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research