%I
%S 1,10,2,3,12,4,13,5,6,14,7,100,15,8,16,9,112,17,11,113,18,28,19,114,
%T 29,20,21,115,22,110,116,23,24,25,117,26,27,30,118,31,32,119,33,34,35,
%U 120,36,121,37,128,122,38,39,129,223,40,124,41,125,42,43,126,44,127,45,47,48,130,49,46,131,50,132,51
%N Lexicographically earliest sequence of distinct positive terms such that a(n) is the number of commas that a(n) has to step over (to the right) in order to find an integer embedding the substring a(n).
%C The integer embedding the substring k might not be the closest one to a(n). Example is given by a(14) = 8 = k. We see that a(8), stepping (to the right) over 8 commas, meets a(22) = 28, which is correct. But a(21) = 18 embeds also the substring 8. We don't mind that.
%H Carole Dubois, <a href="/A333478/b333478.txt">Table of n, a(n) for n = 1..5000</a>
%e a(1) = 1 steps over 1 comma and finds a(2) = 10 which embeds the substring 1;
%e a(2) = 10 steps over 10 commas and finds a(12) = 100 which embeds the substring 10;
%e a(3) = 2 steps over 2 commas and finds a(5) = 12 which embeds the substring 2;
%e a(4) = 3 steps over 3 commas and finds a(7) = 13 which embeds the substring 3; etc.
%K base,nonn
%O 1,2
%A _Eric Angelini_ and _Carole Dubois_, Mar 23 2020
