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.

A233066 Number of (5+1)X(n+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i*x(i,j), i=1..5+1} nondecreasing.

Original entry on oeis.org

132, 1933, 26819, 334580, 3849923, 41069900, 410815334, 3882304854, 34909282490, 300390631126, 2485871001226, 19866918000644, 153888527063899
Offset: 1

Views

Author

R. H. Hardin, Dec 03 2013

Keywords

Comments

Row 5 of A233062

Examples

			Some solutions for n=4
..0..0..0..0..1....0..0..0..0..1....0..0..0..1..0....0..0..0..1..0
..0..0..1..0..1....0..0..0..0..1....0..0..0..1..0....0..0..0..1..0
..1..0..0..1..0....0..0..1..0..0....0..0..1..0..1....0..0..1..1..0
..0..1..0..1..1....1..0..0..0..1....0..1..0..1..1....0..0..0..1..1
..0..0..1..1..1....0..0..0..1..1....0..0..1..1..1....0..1..0..0..1
..1..1..1..1..1....0..1..1..1..1....0..1..1..1..1....0..0..1..0..1