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.

A233303 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^2*x(i,j), i=1..3+1} nondecreasing.

Original entry on oeis.org

31, 141, 567, 1986, 6292, 18205, 48913, 123084, 292784, 662512, 1434508, 2985639, 5997455, 11666253, 22040149, 40541549, 72770415, 127706638, 219494579, 370035418, 612722058, 997726253, 1599424522, 2526675993, 3936943281
Offset: 1

Views

Author

R. H. Hardin, Dec 07 2013

Keywords

Comments

Row 3 of A233301, row 4 of A267245.

Examples

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