cp's OEIS Frontend

A093091 "Fibonacci in pairs from left": start with a(1)=1, a(2)=1; repeatedly adjoin sum of previous two terms but chopped from the left into pairs of 2 digits.

%I A093091 #2 Oct 09 2013 14:17:20
%S A093091 1,1,2,3,5,8,13,21,34,55,89,14,4,10,3,18,14,13,21,32,27,34,53,59,61,
%T A093091 87,11,2,12,0,14,8,98,13,14,12,14,22,10,6,11,1,27,26,26,36,32,16,17,
%U A093091 12,28,53,52,62,68,48,33,29,40,81,10,5,11,4,13,0,11,6,81,62,69,12,1,91,15,16
%N A093091 "Fibonacci in pairs from left": start with a(1)=1, a(2)=1; repeatedly adjoin sum of previous two terms but chopped from the left into pairs of 2 digits.
%C A093091 Do all pairs of digits appear infinitely often? The sequence is not periodic.
%e A093091 ... a(11)=a(9)+a(10), a(12)=left pair of (a(10)+a(11)=55+89=14 4),
%e A093091 a(13)=right pair of (a(10)+a(11)=55+89=14 4),
%e A093091 a(14)=left pair of (a(11)+a(12)=89+14=10 3),
%e A093091 a(15)=right pair of (a(11)+a(12)=89+14=10 3), a(16)=a(12)+a(13) ...
%Y A093091 Cf. A093086, A093087, A093088, A093089, A093090.
%K A093091 nonn,base
%O A093091 1,3
%A A093091 _Bodo Zinser_, Mar 20 2004