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.

A201381 Number of nX5 0..1 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.

Original entry on oeis.org

2, 9, 115, 483, 7148, 24779, 295813, 804538, 7711613, 17135660, 137991357, 261853930, 1838296465, 3078156753, 19352193027, 29273561002, 168059197372, 233637796573, 1242746736360, 1608517392555, 8015798428649, 9756858004272
Offset: 1

Views

Author

R. H. Hardin Nov 30 2011

Keywords

Comments

Column 5 of A201384

Examples

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