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.

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

Original entry on oeis.org

22, 130, 723, 4393, 26819, 162916, 986252, 5942365, 35694392, 213988742, 1280906379, 7658873200, 45771779047, 273459449270, 1633697384455
Offset: 1

Views

Author

R. H. Hardin, Dec 03 2013

Keywords

Comments

Column 3 of A233062

Examples

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