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.

A113045 Number triangle binomial(n,floor((n-k)/2)) mod 3.

Original entry on oeis.org

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

Views

Author

Paul Barry, Oct 11 2005

Keywords

Comments

Row sums appear to be A051638. First row appears to be A039971. Diagonal sums are A113046.

Examples

			Rows begin
1;
1,1;
2,1,1;
0,0,1,1;
0,1,1,1,1;
1,1,2,2,1,1;
2,0,0,0,0,1,1;
		
Showing 1-1 of 1 results.