The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A322984 Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = 2n. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
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. also A322997.
Sequence in context: A131796 A131794 A145726 * A277822 A327616 A181631
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 29 22:36 EDT 2024. Contains 372954 sequences. (Running on oeis4.)