The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A273882 Pick any pair of "4" digits in the sequence. Those two "4"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. 1
 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, 35, 34, 36, 37, 38, 39, 40, 41, 50, 51, 42, 52, 43, 53, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 45, 66, 67, 68, 69, 70, 54, 71, 46, 72, 73, 75, 76, 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 "4" Sequence in context: A272284 A322554 A330232 * A277112 A291168 A146296 Adjacent sequences:  A273879 A273880 A273881 * A273883 A273884 A273885 KEYWORD nonn,base AUTHOR Eric Angelini and Jean-Marc Falcoz, Jun 02 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 21:38 EDT 2021. Contains 345010 sequences. (Running on oeis4.)