A241664 Number of iterations of A058026 needed to reach either 0 or 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

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