login
A226942
Number of iterations of A226911 until 0 is reached, for starting value n.
1
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,3
COMMENTS
Iterating the map A226911 was suggested in the SeqFan post by E. Angelini, cf link.
LINKS
M. Hasler in reply to E. Angelini, English number words modulo themselves, SeqFan list, Jun 21 2013
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
PROG
(PARI) A226942 = n -> for(c=1, 9e9, (n=A226911(n))||return(c))
KEYWORD
nonn,word
AUTHOR
M. F. Hasler, Jun 23 2013
STATUS
approved