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 A322984 #8 Jan 07 2019 11:12:42 %S A322984 1,1,2,1,2,3,1,1,2,3,1,2,1,1,2,1,2,3,1,2,1,1,2,3,1,1,2,1,3,2,1,1,2,3, %T A322984 1,2,1,1,2,3,1,1,2,1,3,2,1,2,1,1,2,1,3,2,1,1,2,2,1,3,1,1,4,1,2,3,1,2, %U A322984 1,1,2,3,1,1,2,1,3,2,1,2,1,1,2,1,3,2,1,1,2,2,1,3,1,1,4,5,1,1,2,1,3,2,1,1,2 %N A322984 Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = 2n. %H A322984 Antti Karttunen, <a href="/A322984/b322984.txt">Table of n, a(n) for n = 1..16384</a> %H A322984 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A322984 a(n) = A322983(2*n). %o A322984 (PARI) %o A322984 A011371(n) = (n - hammingweight(n)); %o A322984 A322983(n) = if((n%2),0,1+A322983(A011371(n))); %o A322984 A322984(n) = A322983(n+n); %Y A322984 Bisection of A322983. %Y A322984 Cf. A000120, A011371. %Y A322984 Cf. also A322997. %K A322984 nonn,base %O A322984 1,3 %A A322984 _Antti Karttunen_, Jan 05 2019