A226942 Number of iterations of A226911 until 0 is reached, for starting value n.

1, 1, 2, 1, 2, 2, 2, 2, 3, 4, 3, 3, 3, 3, 3, 1, 3, 2, 5, 3, 4, 4, 2, 3, 4, 3, 5, 2, 2, 5, 5, 6, 4, 4, 2, 3, 4, 3, 5, 2, 4, 2, 4, 4, 4, 5, 3, 5, 3, 2, 4, 4, 2, 3, 3, 3, 4, 5, 4, 5, 4, 6, 6, 3, 4, 4, 3, 5, 2, 3, 2, 4, 4, 5, 2, 5, 5, 3, 5, 6, 6, 3, 4

Offset: 1

Author

M. F. Hasler, Jun 23 2013

Keywords

• nonn
• word

Comments

Iterating the map A226911 was suggested in the SeqFan post by E. Angelini, cf link.

Links

• Robert Israel, Table of n, a(n) for n = 1..10000
• M. Hasler in reply to E. Angelini, English number words modulo themselves, SeqFan list, Jun 21 2013

Crossrefs

Cf. A073327, A073029, A119945, A072922, A075831, A152611, A052360.

Programs

Maple

f:= proc(n) local S;
  uses StringTools;
  S:= Select(IsAlpha, convert(n, english));
  convert(map(`-`, convert(S, bytes), 96), `+`) mod n
end proc:
g:= proc(n) option remember;
    local v;
    v:= f(n);
    1+procname(v)
end proc:
g(0):= 0:
map(g, [$1..100]); # Robert Israel, Jun 13 2019

PARI

A226942 = n -> for(c=1,9e9,(n=A226911(n))||return(c))