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.

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

Original entry on oeis.org

66, 564, 4393, 30692, 197625, 1180594, 6637131, 35376058, 180164000, 881727864, 4167848342, 19104362313, 85219992355, 371017908349, 1580512646968, 6602183440874, 27094731309792, 109419938432611, 435460987461844
Offset: 1

Views

Author

R. H. Hardin, Dec 03 2013

Keywords

Comments

Row 4 of A233062

Examples

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