login
A325562
Number of iterations of A234741 needed when started from n before a fixed point is reached.
3
0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 2, 1, 0, 0, 1, 0, 0, 2, 0, 0, 1, 0, 0, 0, 3, 1, 0, 0, 0, 1, 2, 0, 1, 0, 0, 0, 0, 0, 2, 0, 2, 1, 0, 0, 2, 2, 0, 1, 0, 0, 1, 0, 4, 1, 0, 0, 1, 0, 0, 2, 0, 0, 2, 0, 0, 1, 3, 0, 2, 0, 0, 0, 0, 3, 2, 1, 0, 0, 0, 0, 2
OFFSET
1,21
FORMULA
If A234741(n) == n, then a(n) = 0, otherwise a(n) = 1 + a(A234741(n)).
PROG
(PARI)
A234741(n) = {n=factor(n); n[, 1]=apply(t->Pol(binary(t)), n[, 1]); sum(i=1, #n=Vec(factorback(n))%2, n[i]<<(#n-i))}; \\ From A234741
A325562(n) = { my(u=A234741(n)); if(u==n, 0, 1+A325562(u)); };
CROSSREFS
Cf. A234741, A235034 (positions of zeros), A260712, A325561.
Sequence in context: A156064 A158757 A294890 * A176917 A302110 A085983
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 10 2019
STATUS
approved