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.

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

Original entry on oeis.org

33544, 4178316, 510685176, 62100488254, 7541722428052, 915571832243030, 111141360154581108, 13491148978500627866, 1637644495947011565142, 198787774684087795661506, 24130123777752397380536568
Offset: 1

Views

Author

R. H. Hardin, Jan 13 2014

Keywords

Comments

Column 7 of A235679

Examples

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