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 A325568 #7 May 11 2019 02:23:59 %S A325568 0,1,1,2,1,2,1,3,2,2,1,3,1,2,1,4,1,3,1,3,2,2,1,4,1,2,1,3,1,2,1,5,2,2, %T A325568 2,4,1,2,1,4,1,3,1,3,2,2,1,5,2,2,1,3,1,2,1,4,1,2,1,3,1,2,1,6,2,3,1,3, %U A325568 1,3,1,5,1,2,2,3,1,2,1,5,1,2,1,4,1,2,1,4,1,3,1,3,2,2,1,6,1,3,1,3,1,2,1,4,2 %N A325568 a(1) = 0; for n > 1, a(n) = 1 + a(A325567(n)). %H A325568 Antti Karttunen, <a href="/A325568/b325568.txt">Table of n, a(n) for n = 1..65537</a> %F A325568 a(1) = 0; for n > 1, a(n) = 1 + a(A325567(n)). %F A325568 a(n) <= A001222(n) for all n. %o A325568 (PARI) %o A325568 A048720(b,c) = fromdigits(Vec(Pol(binary(b))*Pol(binary(c)))%2, 2); %o A325568 A065621(n) = bitxor(n-1,n+n-1); %o A325568 A325567(n) = if(1==n,n,fordiv(n,d,if((d>1)&&A048720(A065621(n/d),d)==n,return(n/d)))); %o A325568 A325568(n) = if(1==n,0,1+A325568(A325567(n))); %Y A325568 Cf. A001222, A048720, A065621, A115872, A325565, A325566, A325567, A325569. %K A325568 nonn %O A325568 1,4 %A A325568 _Antti Karttunen_, May 09 2019