%I
%S 3,10,6,20,9,100,14,30,18,40,50,24,60,28,70,80,34,90,38,1000,39,46,
%T 101,110,54,102,59,200,64,103,69,300,74,104,79,400,84,105,89,500,94,
%U 106,99,100000000,1010,108,112,121,201,127,202,133,203,139,204,145,205,151
%N List the positions of all digits 0 in the concatenation of all terms, not necessarily in order. This is the lexicographically earliest such sequence.
%C See A210415 for comments, links, and code.
%H Danny Rorabaugh, <a href="/A210414/b210414.txt">Table of n, a(n) for n = 1..1000</a>
%e The sequence cannot start with 0 (offset starting from 1), 1 (in first position we have 1 not 0) or 2 (the second entry cannot start with 0). Then 3. Then 10 that is the minimum number with 0 as second digit. And so on.
%Y Cf. A210415A210423. See A167519 for another version.
%K nonn,base
%O 1,1
%A _Paolo P. Lava_, Mar 26 2012
%E Name edited and a(22)a(58) corrected by _Danny Rorabaugh_, Nov 30 2015
