|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Iterating the map A226911 was suggested in the SeqFan post by E. Angelini, cf link.
|
|
LINKS
|
|
|
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:
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|