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

208, 2456, 28584, 330840, 3824528, 44196144, 510685176, 5900818062, 68181837738, 787815537064, 9102909355490, 105180650740834, 1215322331681740, 14042586259073748, 162256730906114932, 1874814669334245592

Offset: 1

Author

R. H. Hardin, Jan 13 2014

Keywords

• nonn

Comments

Column 3 of A235679

Examples

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

Links

• R. H. Hardin, Table of n, a(n) for n = 1..210

Formula

Empirical: a(n) = 13*a(n-1) -7*a(n-2) -120*a(n-3) +60*a(n-4) +376*a(n-5) -111*a(n-6) -477*a(n-7) +47*a(n-8) +216*a(n-9) +20*a(n-10) -16*a(n-11)