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

Author

Antti Karttunen, Jan 05 2019

Keywords

• nonn
• base

Links

• Antti Karttunen, Table of n, a(n) for n = 1..16384
• Index entries for sequences related to binary expansion of n

Crossrefs

Bisection of A322983.

Cf. A000120, A011371.

Cf. also A322997.

Programs

PARI

A011371(n) = (n - hammingweight(n));
A322983(n) = if((n%2),0,1+A322983(A011371(n)));
A322984(n) = A322983(n+n);

Formula

a(n) = A322983(2*n).