A235449 T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the difference between each 2 X 2 subblock maximum and minimum lexicographically nondecreasing rowwise and columnwise.
16, 58, 58, 208, 382, 208, 742, 2476, 2476, 742, 2644, 15936, 28962, 15936, 2644, 9418, 102376, 335898, 335898, 102376, 9418, 33544, 657290, 3886120, 7017768, 3886120, 657290, 33544, 119470, 4219322, 44920240, 146213244, 146213244, 44920240
Offset: 1
Examples
Some solutions for n=3, k=4 ..0..0..0..1..0....0..0..1..0..1....0..0..0..0..0....0..0..1..0..1 ..0..1..1..1..0....0..0..0..1..1....1..1..0..1..0....0..1..0..1..0 ..1..1..0..1..0....0..0..1..0..0....0..0..0..1..0....0..1..0..0..1 ..0..0..1..0..0....0..1..1..1..1....0..1..0..1..0....0..0..0..1..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..144
Crossrefs
Column 1 is A180143(n+1).
Formula
Empirical for column k:
k=1: a(n) = 4*a(n-1) -a(n-2) -2*a(n-3);
k=2: a(n) = 8*a(n-1) -8*a(n-2) -16*a(n-3) +12*a(n-4) +14*a(n-5) -a(n-6) -2*a(n-7);
k=3: [order 19];
k=4: [order 53].
Comments