Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Mar 30 2012 17:25:12
%S 1,2,3,5,13,18,49,67,116,299,415,714,1843,2557,6957,9514,16471,42456,
%T 58927,160310,219237,379547,978331,1357878,2336209,6030296,8366505,
%U 22763306,31129811,53893117,138916045,192809162,331725207,856259576
%N a(n) = k*a(n-1) + a(n-2) where k = A003842(a); a(0) = 1.
%C Aperiodic recursive rabbit sequence.
%C The recursive Fibonacci-like multiplier k is derived from the rabbit sequence (1 0 1 1 0 1 0 1...) in which the 0's are replaced by 2's, getting the rabbit sequence of A003842: (1 2 1 1 2 1 2 1...).
%e a(6) = 49 = 2*18 + 13; where 2 = A003842(6)
%Y Cf. A003842.
%K nonn
%O 0,2
%A _Gary W. Adamson_, May 30 2005
%E Corrected and extended by _T. D. Noe_, Nov 02 2006