This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A273888 #10 Dec 27 2023 12:03:35 %S A273888 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, %T A273888 26,27,28,29,31,30,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48, %U A273888 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 %N 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. %C A273888 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). %H A273888 Eric Angelini, <a href="/A273888/b273888.txt">Table of n, a(n) for n = 1..1011</a> %H A273888 See oeis.org/A273376 for the equivalent sequence dealing with digit-"1" pairs instead of "0" %K A273888 nonn,base %O A273888 1,3 %A A273888 _Eric Angelini_ and _Jean-Marc Falcoz_, Jun 02 2016