cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A128810 Triangle formed by reading triangle A064189 mod 2 .

Original entry on oeis.org

1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1
Offset: 0

Views

Author

Philippe Deléham, Apr 09 2007

Keywords

Comments

Also triangle formed by reading triangles A091965, A108149, A110877, A125906, A126954 mod 2 .

Examples

			Triangle begins:
1;
1, 1;
0, 0, 1;
0, 1, 1, 1;
1, 0, 1, 0, 1;
1, 0, 1, 0, 1, 1;
1, 0, 1, 0, 0, 0, 1;
1, 0, 1, 1, 0, 1, 1, 1;
1, 0, 0, 0, 0, 0, 1, 0, 1;
1, 1, 0, 0, 0, 1, 1, 0, 1, 1;
0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1 ;...
		

Formula

Sum_{k, 0<=k<=n}T(n,k)*x^k=A039963(n), A097357(n+1), A110565(n+1) for x=0,1,2 respectively . T(n,k)= (T(n-1,k-1)+T(n-1,k)+T(n-1,k+1)) mod 2, T(0,0)=1, T(n,k)=0 if k<0 or if k>n .
Showing 1-1 of 1 results.