|
%I
%S 1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,3,3,3,4,3,3,3,4,3,3,3,4,4,4,4,4,
%T 4,4,5,5,5,5,5,5,5,5,5,6,6,6,7,6,6,6,7,6,6,6,7,7,7,7,7,7,7,8,8,8,8,8,
%U 8,8,8,8,9,10,9,10,9,10,9,10,9,10,9,10,9,10,9,10,9,10,11,11,11,11,11,11,11,11,11,12,12,12,13,12,12,12,13,12,12,12,13,13,13,13,13,13,13,14,14,14
%N Parse the infinite string 0123456780123456780123456780... into distinct phrases 0, 1, 2, 3, 4, 5, 6, 7, 8, 01, 23, 45, 67, 80, 12, 34, 56, 78, 012, ...; a(n) = length of n-th phrase.
%C See A187180 for details.
%Y See A187180-A187188 for alphabets of size 2 through 10.
%K nonn
%O 1,10
%A _N. J. A. Sloane_, Mar 06 2011
|
