%I A107358
%S A107358 0,1,1,2,3,5,8,13,21,34,55,89,144,233,376,608,982,1587,2564,4143,6694,
               10816,
%T A107358 17476,28237,45624,73717,119108,192449,310949,502416,811778,1311630,2119265,
%U A107358 3424201,5532650,8939375,14443788,23337539,37707610,60926041,98441202,
               159056294
%N A107358 Dying rabbits: a(n) = Fibonacci(n) for n <= 12; for n >= 13, a(n)=a(n-1)+a(n-2)-a(n-13).
%C A107358 In the limit, the growth rate is 1.61575... per generation as opposed 
               to 1.61803... for Fibonacci numbers. - T. D. Noe, Jan 22 2009
%D A107358 J. H. E. Cohn, Letter to the editor, Fib. Quart. 2 (1964), 108.
%D A107358 V. E. Hoggatt, Jr. and D. A. Lind, The dying rabbit problem, Fib. Quart. 
               7 (1969), 482-487.
%H A107358 T. D. Noe, <a href="b107358.txt">Table of n, a(n) for n=0..500</a>
%F A107358 G.f.: x/((x-1)*(1+x)*(x^11+x^9+x^7+x^5+x^3+x-1)). [From R. J. Mathar 
               (mathar(AT)strw.leidenuniv.nl), Jul 27 2009]
%p A107358 with(combinat); f:=proc(n) option remember; if n <= 12 then RETURN(fibonacci(n)); 
               fi; f(n-1)+f(n-2)-f(n-13); end;
%Y A107358 See A000045 for the Fibonacci numbers. This is a better version of A000044.
%Y A107358 Sequence in context: A023441 A023442 A000044 this_sequence A132636 A152163 
               A039834
%Y A107358 Adjacent sequences: A107355 A107356 A107357 this_sequence A107359 A107360 
               A107361
%K A107358 nonn
%O A107358 0,4
%A A107358 N. J. A. Sloane (njas(AT)research.att.com), May 25 2005