T(n,k)=Number of nXk nonnegative integer arrays with adjacent horizontal and vertical element pair sums equal to all values in 0..2nk-n-k-1 (each exactly once)
0, 1, 1, 2, 8, 2, 4, 36, 36, 4, 12, 544, 3216, 544, 12, 44, 12700, 257664, 257664
1 seqfan posts
Wed Dec 28 00:41:09 CET 2011 [seqfan] nXk sums of pairs of neighbor values = {0..number of neighbors} ?