%I A006520 M2344
%S A006520 1,3,4,8,9,11,12,20,21,23,24,28,29,31,32,48,49,51,52,56,57,59,60,68,69,
%T A006520 71,72,76,77,79,80,112,113,115,116,120,121,123,124,132,133,135,136,140,
%U A006520 141,143,144,160,161,163,164,168,169,171,172,180,181,183,184,188,189
%N A006520 Partial sums of A006519.
%D A006520 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A006520 R. Stephan, <a href="somedcgf.html">Some divide-and-conquer sequences 
               ...</a>
%H A006520 R. Stephan, <a href="a079944.ps">Table of generating functions</a>
%F A006520 a(n)/(n*log(n)) is bounded - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Dec 17 2002
%F A006520 G.f.: 1/x/(1-x) * (x/(1-x) + Sum(k>=1, 2^(k-1)*x^2^k/(1-x^2^k))). - Ralf 
               Stephan (ralf(AT)ark.in-berlin.de), Apr 17 2003
%F A006520 a(n) = b(n+1), with b(2n) = 2b(n) + n, b(2n+1) = 2b(n) + n + 1. - Ralf 
               Stephan (ralf(AT)ark.in-berlin.de), Sep 07 2003
%o A006520 (PARI) a(n)=sum(i=1,n,2^valuation(i,2))
%Y A006520 First differences of A022560.
%Y A006520 Sequence in context: A057549 A047460 A068056 this_sequence A054204 A050003 
               A073258
%Y A006520 Adjacent sequences: A006517 A006518 A006519 this_sequence A006521 A006522 
               A006523
%K A006520 nonn,easy
%O A006520 0,2
%A A006520 N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
%E A006520 More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 17 2002