A325562 - OEIS

A325562

Number of iterations of A234741 needed when started from n before a fixed point is reached.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,21

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65537

Index entries for sequences related to polynomials in ring GF(2)[X]

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