A253164 T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally.
81, 558, 558, 3844, 5136, 3844, 26784, 46752, 46752, 26784, 186624, 443362, 555842, 443362, 186624, 1296000, 4189216, 7252320, 7252320, 4189216, 1296000, 9000000, 39478862, 92998506, 135741428, 92998506, 39478862, 9000000, 62568000
Offset: 1
Examples
Some solutions for n=2 k=4 ..0..2..1..2..2....0..0..0..1..1....0..0..1..1..2....0..0..1..0..0 ..0..2..2..0..0....0..1..2..2..0....1..2..1..2..1....0..2..1..1..1 ..1..0..1..1..0....2..0..2..0..0....1..0..2..1..0....1..2..2..2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..60
Crossrefs
Column 1 is A185771
Formula
Empirical for column k:
k=1: a(n) = 3*a(n-1) +96*a(n-3) +504*a(n-4) +792*a(n-5) +2304*a(n-6) -13824*a(n-8) -13824*a(n-9)
Comments