Search: id:A104234
Results 1-1 of 1 results found.

%I A104234
%S A104234 0,1,1,1,0,2,1,1,0,1,1,1,1,2,1,1,0,1,1,1,0,2,1,1,0,1,1,2,1,2,1,1,0,1,1,
               1,
%T A104234 0,2,1,1,0,1,1,1,1,2,1,1,0,1,1,1,0,2,1,1,0,1,2,2,1,2,1,1,0,1,1,1,0,2,1,
%U A104234 1,0,1,1,1,1,2,1,1,0,1,1,1,0,2,1,1,0,1,1,2,1,2,1,1,0,1,1,1,0,2,1,1,0,1
%N A104234 Number of k >= 1 such that k+n == 0 mod 2^k.
%C A104234 Number of terms in the summation in the formula for A102370(n).
%C A104234 Also, a(n) is the number of 1's in (A103185(n) written in base 2).
%D A104234 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 A104234 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 A104234 a(2^k + y ) = a(y) + 1 if y = 2^k - k - 1, = a(y) otherwise (where 0 
               <= y <= 2^k - 1)
%p A104234 f:=proc(n) local t1,l; t1:=0; for l from 1 to n do if n+l mod 2^l = 0 
               then t1:=t1+1; fi; od: t1; end;
%Y A104234 Cf. A102370, A103185, A105035 (records).
%Y A104234 Sequence in context: A073490 A135341 A033665 this_sequence A037870 A026920 
               A060763
%Y A104234 Adjacent sequences: A104231 A104232 A104233 this_sequence A104235 A104236 
               A104237
%K A104234 nonn
%O A104234 0,6
%A A104234 N. J. A. Sloane (njas(AT)research.att.com), Apr 02 2005

Search completed in 0.001 seconds