A253294 T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with every 2 X 2 subblock sum differing from its neighbors horizontally, vertically, diagonally and antidiagonally.
81, 558, 558, 3844, 3600, 3844, 26784, 23546, 23546, 26784, 186624, 167832, 140536, 167832, 186624, 1296000, 1184928, 1029888, 1029888, 1184928, 1296000, 9000000, 8243488, 7431136, 8153960, 7431136, 8243488, 9000000, 62568000, 57474376
Offset: 1
Examples
Some solutions for n=3, k=4 ..0..0..0..0..2....0..0..0..1..0....0..0..1..2..2....0..0..0..1..2 ..2..0..0..2..1....0..2..2..2..0....0..2..1..2..1....0..0..1..2..2 ..1..0..1..1..2....0..1..2..2..0....2..2..0..0..1....2..0..2..0..2 ..2..1..0..1..1....0..1..1..1..0....1..2..0..2..2....1..2..0..0..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..84
Crossrefs
Column 1 is A185771.
Formula
Empirical for column k:
k=1: [linear recurrence of order 9];
k=2: [order 40].
Comments