

A209686


For each n, define a sequence of numbers by S(0)=n, S(i) = sum of last three digits of the concatenation S(0)S(1)S(2)...S(i1); a(n) = smallest m such that S(m) = 11, or 1 if 11 is never reached.


1



1, 6, 8, 14, 7, 6, 13, 16, 6, 7, 5, 0, 3, 8, 6, 13, 16, 6, 7, 7, 15, 11, 7, 6, 13, 16, 6, 7, 9, 1, 9, 15, 6, 13, 16, 6, 7, 12, 1, 10, 4, 6, 13, 16, 6, 7, 9, 1, 2, 4, 6, 13, 16, 6, 7, 5, 1, 20, 13, 1, 13, 16, 6, 7, 4, 1, 12, 2, 5, 3, 16, 6, 7, 10, 1, 3, 11, 15, 6, 13, 6, 7, 19, 1, 14, 6, 2, 7, 5, 9, 7, 9, 1, 12, 4, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)




