[seqfan] Add the largest invisible digit

[Eric Angelini]

Hello SeqFans,
the "invisible digit" idea could produce,
if adopted, some nice sequences. Example:

a(1)=1
a(n)=a(n-1)+"the largest invisible digit of a(n-1)"

S=1,10,19,27,36,45,54,63,72,81,90,98,105,114,123,...

10 follows 1 because 9 is not visible in "1" and "1"+9 = 10;
19 follows 10 because 9 is not visible in "10" and "10"+9 = 19;
27 follows 10 because 8 is not visible in "19" and "19"+8 = 27;
...

Best,
É.