The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A241664 Number of iterations of A058026 needed to reach either 0 or 1. 1
 0, 1, 1, 1, 2, 1, 3, 1, 2, 1, 3, 1, 4, 1, 2, 1, 3, 1, 4, 1, 3, 1, 4, 1, 3, 1, 3, 1, 4, 1, 5, 1, 3, 1, 3, 1, 4, 1, 4, 1, 5, 1, 6, 1, 3, 1, 4, 1, 4, 1, 3, 1, 4, 1, 4, 1, 4, 1, 5, 1, 6, 1, 3, 1, 4, 1, 5, 1, 4, 1, 5, 1, 6, 1, 3, 1, 4, 1, 5, 1, 4, 1, 5, 1, 4, 1, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS I conjecture that, for n>3 and n odd, we have a(n)>=log((49/15)n)/log(7). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 C. Defant, On Arithmetic Functions Related to Iterates of the Schemmel Totient Functions, J. Int. Seq. 18 (2015) # 15.2.1 Colin Defant, Python program for A241664 EXAMPLE A058026(7)=5, A058026(5)=3, A058026(3)=1. As it takes 3 iterations to reach 1, a(7)=3. PROG The link above provides a Python program. Enter m=2 as well as starting and ending values of n. The third string of numbers will be this sequence. (Haskell) a241664 n = fst \$ until ((<= 1) . snd)                         (\(u, v) -> (u + 1, a058026 v)) (0, n) -- Reinhard Zumkeller, May 10 2014 CROSSREFS Sequence in context: A309978 A108103 A111376 * A157226 A156249 A187808 Adjacent sequences:  A241661 A241662 A241663 * A241665 A241666 A241667 KEYWORD nonn,look AUTHOR Colin Defant, Apr 26 2014 EXTENSIONS a(1) corrected by Reinhard Zumkeller, May 10 2014 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.

Last modified May 9 04:49 EDT 2021. Contains 343687 sequences. (Running on oeis4.)