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.

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

Original entry on oeis.org

16, 382, 28962, 7017768, 5485253042, 13868068262164, 113555975474406500, 3012872125570872924612
Offset: 1

Views

Author

R. H. Hardin, Jan 10 2014

Keywords

Comments

Diagonal of A235449

Examples

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