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 A322983 #12 Jan 07 2019 11:12:35 %S A322983 0,1,0,1,0,2,0,1,0,2,0,3,0,1,0,1,0,2,0,3,0,1,0,2,0,1,0,1,0,2,0,1,0,2, %T A322983 0,3,0,1,0,2,0,1,0,1,0,2,0,3,0,1,0,1,0,2,0,1,0,3,0,2,0,1,0,1,0,2,0,3, %U A322983 0,1,0,2,0,1,0,1,0,2,0,3,0,1,0,1,0,2,0,1,0,3,0,2,0,1,0,2,0,1,0,1,0,2,0,1,0 %N A322983 Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = n. %C A322983 Terms 0 .. 10 occur for the first time at n = 1, 2, 6, 12, 126, 192, 486, 492, 498, 504, 65458. %H A322983 Antti Karttunen, <a href="/A322983/b322983.txt">Table of n, a(n) for n = 1..65537</a> %H A322983 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A322983 If n is odd, a(n) = 0, if n is even, a(n) = 1 + a(A011371(n)). %o A322983 (PARI) A322983(n) = if((n%2),0,1+A322983(n - hammingweight(n))); %Y A322983 Cf. A000120, A011371, A071542, A179016, A213710, A322984 (bisection). %Y A322983 Cf. also A322996. %K A322983 nonn,base %O A322983 1,6 %A A322983 _Antti Karttunen_, Jan 05 2019