cp's OEIS Frontend

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

%I A226942 #13 Dec 23 2024 14:53:43
%S A226942 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 A226942 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 A226942 2,3,2,4,4,5,2,5,5,3,5,6,6,3,4
%N A226942 Number of iterations of A226911 until 0 is reached, for starting value n.
%C A226942 Iterating the map A226911 was suggested in the SeqFan post by E. Angelini, cf link.
%H A226942 Robert Israel, <a href="/A226942/b226942.txt">Table of n, a(n) for n = 1..10000</a>
%H A226942 M. Hasler in reply to E. Angelini, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2013-June/011350.html">English number words modulo themselves</a>, SeqFan list, Jun 21 2013
%p A226942 f:= proc(n) local S;
%p A226942   uses StringTools;
%p A226942   S:= Select(IsAlpha, convert(n, english));
%p A226942   convert(map(`-`, convert(S, bytes), 96), `+`) mod n
%p A226942 end proc:
%p A226942 g:= proc(n) option remember;
%p A226942     local v;
%p A226942     v:= f(n);
%p A226942     1+procname(v)
%p A226942 end proc:
%p A226942 g(0):= 0:
%p A226942 map(g, [$1..100]); # _Robert Israel_, Jun 13 2019
%o A226942 (PARI) A226942 = n -> for(c=1,9e9,(n=A226911(n))||return(c))
%Y A226942 Cf. A073327, A073029, A119945, A072922, A075831, A152611, A052360.
%K A226942 nonn,word
%O A226942 1,3
%A A226942 _M. F. Hasler_, Jun 23 2013