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
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
KEYWORD
nonn,look
AUTHOR
Colin Defant, Apr 26 2014
EXTENSIONS
a(1) corrected by Reinhard Zumkeller, May 10 2014
STATUS
approved