A322984 -id:A322984 - cp's OEIS frontend

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

Antti Karttunen, Jan 05 2019

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

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

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

Cf. also A322996.

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

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

A322997 Number of iterations of A049820(x) = x - A000005(x) needed to reach an odd number or zero, when starting from x = 2n.

Original entry on oeis.org

0, 1, 1, 2, 2, 3, 3, 4, 1, 4, 5, 5, 2, 6, 6, 6, 7, 7, 1, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 11, 10, 12, 1, 12, 13, 13, 11, 14, 14, 14, 14, 15, 12, 16, 15, 15, 17, 16, 13, 18, 1, 17, 14, 18, 14, 18, 18, 19, 19, 20, 15, 21, 21, 20, 16, 22, 16, 23, 17, 23, 17, 24, 1, 25, 25, 24, 2, 26, 2, 27, 26, 3, 28, 4, 3, 4, 5, 5, 5, 6

Offset: 0

Antti Karttunen, Jan 05 2019

nonn

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

Bisection of A322996.
Cf. A000005, A049820.
Cf. also A322984.

A322997(n) = { n +=n; for(j=0,oo,if((!n)||(n%2),return(j)); n -= numdiv(n)); };

a(n) = A322996(2n).

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula