A128937 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A128937

Triangle formed by reading A039598 mod 2.

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

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

Also triangle formed by reading triangles A052179, A053121, A124575, A126075, A126093.

Also triangle formed by reading A065600 mod 2. - Philippe Deléham, Oct 15 2007

LINKS

Table of n, a(n) for n=0..104.

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:

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

Cf. A048896 (row sums).

Sequence in context: A127253 A117944 A117945 * A288004 A102511 A266669

Adjacent sequences: A128934 A128935 A128936 * A128938 A128939 A128940

KEYWORD

nonn,tabl,easy

AUTHOR

Philippe Deléham, Apr 27 2007, May 02 2007

STATUS

approved