%I
%S 1,10,2,3,4,5,6,7,8,9,9,1,1,2,3,3,1,2,4,4,1,2,3,5,5,1,2,3,4,6,6,1,2,3,
%T 4,5,7,7,1,2,3,4,5,6,8,8,1,2,3,4,5,6,7,9,9,1,2,3,4,5,6,7,8,8,8,8,1,1,
%U 2,3,3,1,2,2,2,1,1,2,3,4,4,1,2,3,3,3,1,1,2,3,3,1,2,4,5,5,1,2,3,4,4,4,1,1,2,3,3,1,2
%N Lexicographically earliest sequence of terms describing its successive chunks of different digits.
%C Put a vertical stroke between two identical digits; those strokes delimitate a succession of chunks whose sizes are given by the sequence itself.
%C There is only one integer 10 in the sequence.
%C The other integers up to a(28445) are 1 (with 7940 copies), 2 (with 6904 copies), 3 (with 6157 copies), 4 (with 3706 copies), 5 (with 2091 copies), 6 (with 1065 copies), 7 (with 445 copies), 8 (with 123 copies) and 9 (with only 14 copies).
%H JeanMarc Falcoz, <a href="/A323421/b323421.txt">Table of n, a(n) for n = 1..28446</a>
%e The stroke technique transforms the sequence into 1  10,2,3,4,5,6,7,8,9  9,1  1,2,3  3,1,2,4 ... and we see indeed that the chunks of different digits have sizes 1, 10, 2, 3, 4, ...
%K nonn,base
%O 1,2
%A _Eric Angelini_ and _JeanMarc Falcoz_, Jan 14 2019
