login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A322983 Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = n. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

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

FORMULA

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

PROG

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

CROSSREFS

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

Cf. also A322996.

Sequence in context: A070090 A230642 A053473 * A208459 A144764 A084929

Adjacent sequences:  A322980 A322981 A322982 * A322984 A322985 A322986

KEYWORD

nonn,base

AUTHOR

Antti Karttunen, Jan 05 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 9 22:52 EDT 2020. Contains 336335 sequences. (Running on oeis4.)