OFFSET
1,2
LINKS
Carole Dubois, Table of n, a(n) for n = 1..5001
EXAMPLE
The sequence starts with a(1) = 1.
We read this 1, see that there is only one digit 1 so far in the sequence, thus k = 1; we have then d + k = (1 + 1) = 2 and this 2 becomes a(2);
We read this 2, see that there is only one digit 2 so far in the sequence, thus k = 1; we have then d + k = (2 + 1) = 3 and this 3 becomes a(3);
We read this 3, see that there is only one digit 3 so far in the sequence, thus k = 1; we have then d + k = (3 + 1) = 4 and this 4 becomes a(4);
...
We now read the first digit of a(10) = 10, see that this 1 is the 2nd digit 1 so far in the sequence, thus k = 2; we have then d + k = (1 + 2) = 3 and this 3 becomes a(11);
We now read the second digit of a(10) = 10, see that this 0 is the 1st digit 0 so far in the sequence, thus k = 1; we have then d + k = 1 and this 1 becomes a(12);
We now read the single digit of a(11) = 3; we see that this 3 is the 2nd digit 3 so far in the sequence, thus k = 2; we have then d + k = 5 and this 5 becomes a(13); etc.
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Eric Angelini and Carole Dubois, May 16 2019
STATUS
approved