A273884 - OEIS

A273884

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

(list; graph; refs; listen; history; text; internal format)

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

CROSSREFS

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

Sequence in context: A085735 A269393 A269394 * A273058 A044922 A346447

Adjacent sequences: A273881 A273882 A273883 * A273885 A273886 A273887

KEYWORD

nonn,base

AUTHOR

Eric Angelini and Jean-Marc Falcoz, Jun 02 2016

STATUS

approved