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

0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 2, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0

Offset: 1

Author

Antti Karttunen, Jan 05 2019

Keywords

• nonn
• base

Comments

Terms 0 .. 10 occur for the first time at n = 1, 2, 6, 12, 126, 192, 486, 492, 498, 504, 65458.

Links

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

Crossrefs

Cf. A000120, A011371, A071542, A179016, A213710, A322984 (bisection).

Cf. also A322996.

Programs

PARI

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

Formula

If n is odd, a(n) = 0, if n is even, a(n) = 1 + a(A011371(n)).