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.

A235446 Number of (n+1)X(5+1) 0..1 arrays with the difference between each 2X2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.

Original entry on oeis.org

2644, 102376, 3886120, 146213244, 5485253042, 205551169550, 7699719982722, 288383414393138, 10800536489561114, 404495358726610494, 15148844516247948642, 567341751928412753520, 21247593602541105806608
Offset: 1

Views

Author

R. H. Hardin, Jan 10 2014

Keywords

Comments

Column 5 of A235449

Examples

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