A273888 Pick any pair of "0" digits in the sequence. Those two "0"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, 31, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 50, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 60, 66, 67, 68, 69, 71, 70, 72, 73, 74, 75, 76, 77, 78

Offset

1,3

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

See oeis.org/A273376 for the equivalent sequence dealing with digit-"1" pairs instead of "0"

Crossrefs

Sequence in context: A269331 A246103 A281873 * A192218 A070915 A083243

Adjacent sequences: A273885 A273886 A273887 * A273889 A273890 A273891

Keyword

nonn,base

Author

Eric Angelini and Jean-Marc Falcoz, Jun 02 2016

Status

approved