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.

A233064 Number of (3+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..3+1} nondecreasing.

Original entry on oeis.org

33, 161, 723, 2875, 10650, 36674, 119979, 373955, 1122568, 3255885, 9181781, 25238126, 67893216, 179078191, 464403265, 1185772147, 2986754467, 7429480493, 18276519761, 44500586535, 107358553904, 256796921471, 609508203405
Offset: 1

Views

Author

R. H. Hardin, Dec 03 2013

Keywords

Comments

Row 3 of A233062

Examples

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