%I A103842
%S A103842 1,1,0,1,0,1,1,1,0,0,1,1,0,1,1,1,1,1,0,1,0,1,1,1,1,0,0,1,1,1,1,1,1,0,0,
%T A103842 0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,0,1,1,0,1,1,1,1,1,1,1,0,1,0,1,1,1,1,1,
%U A103842 1,1,1,1,0,1,0,0,1,1,1,1,1,1,1,1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,0
%N A103842 Triangle read by rows: row n is binary expansion of 2^n-n, n >= 1.
%C A103842 This sequence can also be obtained by reading (from bottom to top, column 
               by column) the array given in A103582 after suppressing the terms 
               below the main diagonal.
%D A103842 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 A103842 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>].
%e A103842 Table begins:
%e A103842 1
%e A103842 1 0
%e A103842 1 0 1
%e A103842 1 1 0 0
%e A103842 1 1 0 1 1
%e A103842 1 1 1 0 1 0
%e A103842 1 1 1 1 0 0 1
%p A103842 p:=proc(n) local A,j,b: A:=convert(2^n-n,base,2): for j from 1 to nops(A) 
               do b:=j->A[nops(A)+1-j] od: seq(b(j),j=1..nops(A)): end: for n from 
               1 to 15 do p(n) od; # yields sequence in triangular form (Deutsch)
%Y A103842 Cf. A000325, A103582.
%Y A103842 Sequence in context: A118268 A143220 A136669 this_sequence A065535 A093719 
               A153778
%Y A103842 Adjacent sequences: A103839 A103840 A103841 this_sequence A103843 A103844 
               A103845
%K A103842 nonn,tabl,easy
%O A103842 1,1
%A A103842 Phillipe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 31 2005
%E A103842 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 16 2005