%I A048641
%S A048641 0,1,4,6,12,19,24,28,40,53,68,82,92,103,112,120,144,169,196,222,252,
%T A048641 283,312,340,360,381,404,426,444,463,480,496,544,593,644,694,748,803,
%U A048641 856,908,968,1029,1092,1154,1212,1271,1328,1384,1424,1465,1508,1550
%N A048641 Partial sums of A003188 (Gray code).
%H A048641 R. Stephan, <a href="somedcgf.html">Some divide-and-conquer sequences 
               ...</a>
%H A048641 R. Stephan, <a href="a079944.ps">Table of generating functions</a>
%F A048641 a(n) = sum(XORnos(j, floor(j/2)), j=0..n)
%F A048641 a(n) = b(n-1), with b(2n)=2(b(n)+b(n-1)+ceil(n/2)), b(2n+1)=4b(n)+n+1. 
               - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 13 2003
%Y A048641 a(2^n-1) = A000217[ 2^n-1 ] for all n.
%Y A048641 Sequence in context: A073123 A079865 A027856 this_sequence A023599 A087881 
               A063607
%Y A048641 Adjacent sequences: A048638 A048639 A048640 this_sequence A048642 A048643 
               A048644
%K A048641 easy,nonn
%O A048641 1,3
%A A048641 Antti Karttunen, Jul 14 1999