|
%I #6 Aug 26 2015 16:43:39
%S 1,1,1,1,1,1,1,1,2,2,2,2,3,2,2,2,2,3,3,3,3,3,3,3,4,4,5,4,4,5,4,4,5,4,
%T 4,5,5,5,5,5,6,6,6,6,7,6,6,6,6,7,7,7,7,7,7,7,8,9,8,9,8,9,8,9,8,9,8,9,
%U 8,9,8,9,10,10,10,10,11,10,10,10,10,11,11,11,11,11,11,11,12,12,13,12,12,13,12,12,13,12,12,13,13,13,13,13,14,14,14,14,15,14,14,14,14,15,15,15,15,15,15,15
%N Parse the infinite string 0123456701234567012345670... into distinct phrases 0, 1, 2, 3, 4, 5, 6, 7, 01, 23, 45, 67, 012, 34, ...; a(n) = length of n-th phrase.
%C See A187180 for details.
%H Ray Chandler, <a href="/A187186/b187186.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Rec#order_65">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1).
%F After the initial block of eight 1's, the sequence is quasi-periodic with period 64, increasing by 8 after each block.
%Y See A187180-A187188 for alphabets of size 2 through 10.
%K nonn
%O 1,9
%A _N. J. A. Sloane_, Mar 06 2011
|
