|
%I #11 Apr 21 2021 10:44:27
%S 1,0,1,1,0,1,0,0,0,1,0,0,1,0,1,0,1,0,0,0,1,1,0,1,0,1,0,1,0,0,0,0,0,0,
%T 0,1,0,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,1,0,1,0,1,0,1,0,0,
%U 0,1,0,0,0,0,0,0,0,1,0,0,1,0,1,0,0,0,0,0,1,0,1,0,1,0,0,0,1,0,0,0,1,0,0,0,1
%N Triangle formed by reading A039598 mod 2.
%C Also triangle formed by reading triangles A052179, A053121, A124575, A126075, A126093.
%C Also triangle formed by reading A065600 mod 2. - _Philippe Deléham_, Oct 15 2007
%F Sum_{k=0..n} T(n,k) = A048896(n).
%F Sum_{k=0..n} T(n,k)*2^(n-k) = A101692(n). - _Philippe Deléham_, Oct 09 2007
%F Sum_{k=0..n} T(n,k)*2^k = A062878(n+1)/3. - _Philippe Deléham_, Aug 31 2009
%e Triangle begins:
%e 1;
%e 0, 1;
%e 1, 0, 1;
%e 0, 0, 0, 1;
%e 0, 0, 1, 0, 1;
%e 0, 1, 0, 0, 0, 1;
%e 1, 0, 1, 0, 1, 0, 1;
%e 0, 0, 0, 0, 0, 0, 0, 1;
%e 0, 0, 0, 0, 0, 0, 1, 0, 1;
%e 0, 0, 0, 0, 0, 1, 0, 0, 0, 1;
%e 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1;
%e 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1;
%e 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1;
%e 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1;
%e 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1;
%e 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1; ...
%p A039598 := proc(n,k)
%p binomial(2*n,n-k)-binomial(2*n,n-k-2) ;
%p end proc:
%p A128937 := proc(n,k)
%p modp(A039598(n,k),2) ;
%p end proc: # _R. J. Mathar_, Apr 21 2021
%Y Cf. A048896 (row sums).
%K nonn,tabl,easy
%O 0,1
%A _Philippe Deléham_, Apr 27 2007, May 02 2007
|
