OFFSET
0,1
COMMENTS
FORMULA
Sum_{k=0..n} T(n,k) = A048896(n).
Sum_{k=0..n} T(n,k)*2^(n-k) = A101692(n). - Philippe Deléham, Oct 09 2007
Sum_{k=0..n} T(n,k)*2^k = A062878(n+1)/3. - Philippe Deléham, Aug 31 2009
EXAMPLE
Triangle begins:
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, 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, 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;
1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1;
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1; ...
MAPLE
A039598 := proc(n, k)
binomial(2*n, n-k)-binomial(2*n, n-k-2) ;
end proc:
A128937 := proc(n, k)
modp(A039598(n, k), 2) ;
end proc: # R. J. Mathar, Apr 21 2021
CROSSREFS
KEYWORD
AUTHOR
Philippe Deléham, Apr 27 2007, May 02 2007
STATUS
approved