%I A103528
%S A103528 0,0,1,0,1,2,1,0,1,2,5,0,1,2,1,0,1,2,5,8,1,2,1,0,1,2,5,0,1,2,1,0,1,2,5,
%T A103528 8,17,2,1,0,1,2,5,0,1,2,1,0,1,2,5,8,1,2,1,0,1,2,5,0,1,2,1,0,1,2,5,8,17,
%U A103528 34,1,0,1,2,5,0,1,2,1,0,1,2,5,8,1,2,1,0,1,2,5,0,1,2,1,0,1,2,5,8
%N A103528 Sum_{k = 1..n-1 such that n == k mod 2^k} 2^(k-1).
%C A103528 Is there a simpler closed form?
%D A103528 David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, 
               Sloping binary numbers: a new sequence related to the binary numbers, 
               J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.
%H A103528 David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, 
               Sloping binary numbers: a new sequence related to the binary numbers 
               [<a href="http://www.research.att.com/~njas/doc/slopey.pdf">pdf</
               a>, <a href="http://www.research.att.com/~njas/doc/slopey.ps">ps</
               a>].
%F A103528 a(n) = (A102371(n) + n)/2 - 2^(n-1). - Philippe DELEHAM, Mar 27 2005
%p A103528 f:=proc(n) local t1,k; t1:=0; for k from 1 to n-1 do if n mod 2^k = k 
               then t1:=t1+2^(k-1); fi; od: t1; end;
%Y A103528 Sequence in context: A136868 A145895 A114503 this_sequence A138352 A129620 
               A074766
%Y A103528 Adjacent sequences: A103525 A103526 A103527 this_sequence A103529 A103530 
               A103531
%K A103528 nonn
%O A103528 1,6
%A A103528 N. J. A. Sloane (njas(AT)research.att.com), Mar 22 2005