This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A108282 #5 Mar 30 2012 17:25:12 %S A108282 1,2,3,5,13,18,49,67,116,299,415,714,1843,2557,6957,9514,16471,42456, %T A108282 58927,160310,219237,379547,978331,1357878,2336209,6030296,8366505, %U A108282 22763306,31129811,53893117,138916045,192809162,331725207,856259576 %N A108282 a(n) = k*a(n-1) + a(n-2) where k = A003842(a); a(0) = 1. %C A108282 Aperiodic recursive rabbit sequence. %C A108282 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 A108282 a(6) = 49 = 2*18 + 13; where 2 = A003842(6) %Y A108282 Cf. A003842. %K A108282 nonn %O A108282 0,2 %A A108282 _Gary W. Adamson_, May 30 2005 %E A108282 Corrected and extended by _T. D. Noe_, Nov 02 2006