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