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.

A238252 Number of (n+1)X(5+1) 0..1 arrays with 2X2 subblock sums lexicographically nondecreasing columnwise and rowwise.

Original entry on oeis.org

676, 9991, 284992, 6683137, 171041320, 3320993180, 64353451945, 992794904591, 15160526139045, 192941078342371, 2433696873065044, 26454369332527825, 285456371748779982, 2719536243017821050, 25745538460612968692
Offset: 1

Views

Author

R. H. Hardin, Feb 21 2014

Keywords

Comments

Column 5 of A238255

Examples

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