%I A008687
%S A008687 0,1,1,2,1,3,2,2,1,4,3,3,2,3,2,2,1,5,4,4,3,4,3,3,2,4,3,3,2,3,2,2,
%T A008687 1,6,5,5,4,5,4,4,3,5,4,4,3,4,3,3,2,5,4,4,3,4,3,3,2,4,3,3,2,3,2,2,
%U A008687 1,7,6,6,5,6,5,5,4,6,5,5,4,5,4,4,3,6,5,5,4,5,4,4,3,5,4,4,3,4,3,3
%N A008687 Number of 1's in 2's complement representation of -n.
%C A008687 a(A127904(n)) = n and a(m) < n for m < A127904(n). - Reinhard Zumkeller, 
               Feb 05 2007
%H A008687 R. Zumkeller, <a href="b008687.txt">Table of n, a(n) for n = 0..10000</
               a>
%H A008687 Michael Gilleland, <a href="selfsimilar.html">Some Self-Similar Integer 
               Sequences</a>
%F A008687 a(n) = if n<=1 then n else (n mod 2) + a((n mod 2) + floor(n/2)). - Reinhard 
               Zumkeller, Feb 05 2007
%F A008687 a(n) = if n<2 then n else a(ceiling(n/2)) + n mod 2. - Reinhard Zumkeller 
               (reinhard.zumkeller(AT)gmail.com), Jul 25 2006
%F A008687 Min{m: a(m)=n} = if n>0 then A083318(n-1) else 0. - Reinhard Zumkeller 
               (reinhard.zumkeller(AT)gmail.com), Jul 25 2006
%Y A008687 A023416(n-1) + 1.
%Y A008687 This is Guy Steele's sequence GS(4, 3) (see A135416).
%Y A008687 Sequence in context: A157810 A072339 A038571 this_sequence A080801 A124758 
               A071481
%Y A008687 Adjacent sequences: A008684 A008685 A008686 this_sequence A008688 A008689 
               A008690
%K A008687 nonn,base
%O A008687 0,4
%A A008687 R. H. Hardin (rhhardin(AT)att.net) (R. H. Hardin)