login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

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

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))

CROSSREFS

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

Sequence in context: A029228 A029215 A240649 * A030371 A029550 A091110

Adjacent sequences:  A226939 A226940 A226941 * A226943 A226944 A226945

KEYWORD

nonn,word

AUTHOR

M. F. Hasler, Jun 23 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 17 16:58 EDT 2019. Contains 325107 sequences. (Running on oeis4.)