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.

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

Original entry on oeis.org

9418, 657290, 44920240, 3043145826, 205551169550, 13868068262164, 935263088301396, 63064724124453082, 4252224342324710504, 286706640921161498010, 19331099358385310094498, 1303390076791046628378510
Offset: 1

Views

Author

R. H. Hardin, Jan 10 2014

Keywords

Comments

Column 6 of A235449.

Examples

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

Crossrefs

Cf. A235449.