login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Two terms that contain the digit "d" are always separated by "d" terms that do not contain the digit "d". This is the lexicographically earliest sequence of distinct nonnegative integers with this property.
2

%I #7 Aug 06 2024 21:43:44

%S 0,10,20,100,30,102,40,101,203,105,60,1024,300,107,200,150,304,1026,

%T 80,109,230,10457

%N Two terms that contain the digit "d" are always separated by "d" terms that do not contain the digit "d". This is the lexicographically earliest sequence of distinct nonnegative integers with this property.

%C The sequence is finite, there is no 23rd term.

%H Eric Angelini, <a href="https://cinquantesignes.blogspot.com/2024/08/digits-and-gaps.html">Digits and gaps</a>, personal blog of the author.

%e As we start the sequence with a(1) = 0, the digit 0 must be present in every term of the sequence.

%e We extend it now with a(2) = 10 as 10 is the smallest integer not present that contains the digit 0.

%e The next term will be a(3) = 20 as 20 is the smallest integer not present that contains the digit 0.

%e The next term will be a(4) = 100 as 100 is the smallest integer not present that contains both the digits 0 and 1.

%e The next term will be a(5) = 30 as 30 is the smallest integer not present that contains the digit 0.

%e The next term will be a(6) = 102 as 102 is the smallest integer not present that contains the digits 0, 1 and 2.

%e The next term will be a(7) = 40 as 40 is the smallest integer not present that contains the digit 0.

%e The next term will be a(8) = 101 as 101 is the smallest integer not present that contains both the digits 0 and 1.

%e Etc.

%Y Cf. A284516.

%K nonn,base,fini,full

%O 1,2

%A _Eric Angelini_ and _Jean-Marc Falcoz_, Aug 06 2024

%E a(14) and successive terms computed by Michael S. Branicky.