A226942 - OEIS

%I #12 Jan 02 2023 12:30:49

%S 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,

%T 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,

%U 2,3,2,4,4,5,2,5,5,3,5,6,6,3,4

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

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

%H Robert Israel, <a href="/A226942/b226942.txt">Table of n, a(n) for n = 1..10000</a>

%H M. Hasler in reply to E. Angelini, <a href="http://list.seqfan.eu/oldermail/seqfan/2013-June/011350.html">English number words modulo themselves</a>, SeqFan list, Jun 21 2013

%p f:= proc(n) local S;

%p   uses StringTools;

%p   S:= Select(IsAlpha, convert(n, english));

%p   convert(map(`-`, convert(S, bytes), 96), `+`) mod n

%p end proc:

%p g:= proc(n) option remember;

%p     local v;

%p     v:= f(n);

%p     1+procname(v)

%p end proc:

%p g(0):= 0:

%p map(g, [$1..100]); # _Robert Israel_, Jun 13 2019

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

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

%K nonn,word

%O 1,3

%A _M. F. Hasler_, Jun 23 2013