login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132680 Number of ones in binary representation of odious numbers. 5
1, 1, 1, 3, 1, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 5, 1, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 5, 5, 5, 1, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 5, 5, 5, 5, 5, 5, 7, 1, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 3, 3, 5, 3, 5, 5, 5, 3, 5, 5, 5, 5, 5, 5, 7, 3, 3, 3, 5, 3, 5, 5, 5, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

a(n) = A000120(A000069(n));

a(A129771(n)) = a((A129771(n)-1)/2) + 2;

a(A083420(n)) = A005408(n).

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10001

Eric Weisstein's World of Mathematics, Odious Number

Eric Weisstein's World of Mathematics, Thue-Morse Sequence

Index entries for sequences related to binary expansion of n

FORMULA

a(n) = a(floor(n/2)) + 2*(n mod 2)*(1-A010060(n)).

PROG

(PARI) a(n)=hammingweight(2*n-1-hammingweight(n-1)%2) \\ Charles R Greathouse IV, Mar 26 2013

CROSSREFS

Sequence in context: A268498 A059787 A081325 * A105595 A072219 A173854

Adjacent sequences:  A132677 A132678 A132679 * A132681 A132682 A132683

KEYWORD

nonn,easy

AUTHOR

Reinhard Zumkeller, Aug 26 2007

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 12 19:19 EST 2018. Contains 317116 sequences. (Running on oeis4.)