This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A325562 #10 Jul 16 2024 04:20:19
%S A325562 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,
%T A325562 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,
%U A325562 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
%N A325562 Number of iterations of A234741 needed when started from n before a fixed point is reached.
%H A325562 Antti Karttunen, <a href="/A325562/b325562.txt">Table of n, a(n) for n = 1..65537</a>
%H A325562 <a href="/index/Ge#GF2X">Index entries for sequences related to polynomials in ring GF(2)[X]</a>
%F A325562 If A234741(n) == n, then a(n) = 0, otherwise a(n) = 1 + a(A234741(n)).
%o A325562 (PARI)
%o A325562 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
%o A325562 A325562(n) = { my(u=A234741(n)); if(u==n,0,1+A325562(u)); };
%Y A325562 Cf. A234741, A235034 (positions of zeros), A260712, A325561.
%K A325562 nonn
%O A325562 1,21
%A A325562 _Antti Karttunen_, May 10 2019