login
"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.
2

%I #2 Oct 09 2013 14:17:20

%S 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 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 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 "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 Do all pairs of digits appear infinitely often? The sequence is not periodic.

%e ... a(11)=a(9)+a(10), a(12)=left pair of (a(10)+a(11)=55+89=14 4),

%e a(13)=right pair of (a(10)+a(11)=55+89=14 4),

%e a(14)=left pair of (a(11)+a(12)=89+14=10 3),

%e a(15)=right pair of (a(11)+a(12)=89+14=10 3), a(16)=a(12)+a(13) ...

%Y Cf. A093086, A093087, A093088, A093089, A093090.

%K nonn,base

%O 1,3

%A _Bodo Zinser_, Mar 20 2004