A237332 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.
81, 320, 320, 1264, 1660, 1264, 5120, 8588, 8588, 5120, 20692, 45996, 58296, 45996, 20692, 82800, 242644, 414268, 414268, 242644, 82800, 332192, 1279474, 2870224, 3988852, 2870224, 1279474, 332192, 1346016, 6740992, 19874388, 36921568
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..1..0..2..2....0..2..1..0..2....0..0..1..2..2....0..1..0..1..1 ..0..1..1..1..2....2..1..2..0..2....2..1..2..2..2....1..0..2..1..0 ..0..2..2..1..0....1..0..0..2..1....1..0..2..2..1....0..0..0..0..1 ..2..0..1..2..2....0..2..2..1..2....2..2..2..1..0....1..1..2..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..112
Formula
Empirical for column k:
k=1: a(n) = 288*a(n-4) -6720*a(n-8) +33536*a(n-12) for n>15
k=2: [order 32] for n>34
Comments