A273881 Pick any pair of "3" digits in the sequence. Those two "3"s are separated by k digits. This is the lexicographically earliest sequence of distinct terms in which all the resulting values of k are distinct.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 40, 32, 41, 42, 44, 45, 46, 34, 47, 43, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 60, 35, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 53, 75, 76, 77, 78, 63, 36, 79, 80, 81, 82, 84, 85, 86, 87, 88, 89, 90, 91, 92, 94, 95, 96, 97, 98, 99, 100, 73, 101

Offset: 1

Author

Eric Angelini and Jean-Marc Falcoz Jun 02 2016

Keywords

• nonn
• base

Comments

The sequence starts with a(1)=0. It is then always extended with the smallest integer not yet present and not leading to a contradiction (which would mean producing a value of k already seen).

Links

• Eric Angelini, Table of n, a(n) for n = 1..1011

Crossrefs

See A273376 for the equivalent sequence dealing with digit-"1" pairs instead of "3"