A322984 Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = 2n.

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

Links

Antti Karttunen, Table of n, a(n) for n = 1..16384

Index entries for sequences related to binary expansion of n

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. A000120, A011371.

Cf. also A322997.

Sequence in context: A131796 A131794 A145726 * A277822 A327616 A181631

Adjacent sequences: A322981 A322982 A322983 * A322985 A322986 A322987

Keyword

nonn,base

Author

Antti Karttunen, Jan 05 2019

Status

approved