%I A132680
%S A132680 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,
%T A132680 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,
%U A132680 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
%N A132680 Number of ones in binary representation of odious numbers.
%C A132680 a(n) = A000120(A000069(n));
%C A132680 a(A129771(n)) = a((A129771(n)-1)/2) + 2;
%C A132680 a(A083420(n)) = A005408(n).
%H A132680 R. Zumkeller, <a href="b132680.txt">Table of n, a(n) for n = 1..10001</
               a>
%H A132680 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               OdiousNumber.html">Odious Number</a>
%H A132680 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Thue-MorseSequence.html">Thue-Morse Sequence</a>
%H A132680 <a href="Sindx_Bi.html#binary">Index entries for sequences related to 
               binary expansion of n</a>
%F A132680 a(n) = a(floor(n/2)) + 2*(n mod 2)*(1-A010060(n)).
%Y A132680 Sequence in context: A143149 A059787 A081325 this_sequence A105595 A072219 
               A059789
%Y A132680 Adjacent sequences: A132677 A132678 A132679 this_sequence A132681 A132682 
               A132683
%K A132680 nonn
%O A132680 1,4
%A A132680 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 26 2007