OFFSET
1,3
COMMENTS
The sequence starts with a(1) = 0 and is always extended with the smallest integer not yet present that doesn't lead to a contradiction.
This sequence is a permutation of the numbers >= 0.
LINKS
Jean-Marc Falcoz, Table of n, a(n) for n = 1..1503
EXAMPLE
There are:
0 digit between the 3 of "3" and the 3 of "30";
1 digit between the 3 of "30" and the 3 of "31";
2 digits between the 3 of "31" and the 3 of "32";
3 digits between the 3 of "32" and the 3 of "34";
3 digits between the 3 of "34" and the first 3 of "33";
0 digit between the 3s of "33";
3 digits between the last 3 of "33" and the 3 of "35";
1 digit between the 3 of "35" and the 3 of "36";
4 digits between the 3 of "36" and the 3 of "13";
3 digits between the 3 of "13" and the 3 of "23";
2 digits between the 3 of "23" and the 3 of "37";
5 digits between the 3 of "37" and the 3 of "38";
6 digits between the 3 of "38" and the 3 of "43";
etc.
We see that the first column here is the succession of the digits of the sequence, as well as the size of each chunk of digits between two successive 3s.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Eric Angelini and Jean-Marc Falcoz, Apr 19 2018
STATUS
approved