login
A322984
Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = 2n.
3
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, 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, 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
OFFSET
1,3
FORMULA
a(n) = A322983(2*n).
PROG
(PARI)
A011371(n) = (n - hammingweight(n));
A322983(n) = if((n%2), 0, 1+A322983(A011371(n)));
A322984(n) = A322983(n+n);
CROSSREFS
Bisection of A322983.
Cf. also A322997.
Sequence in context: A131796 A131794 A145726 * A277822 A327616 A181631
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Jan 05 2019
STATUS
approved