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.

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

Original entry on oeis.org

34, 319, 2875, 30692, 334580, 3654675, 39886178, 433495407, 4690717033, 50556528980
Offset: 1

Views

Author

R. H. Hardin, Dec 03 2013

Keywords

Comments

Column 4 of A233062

Examples

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