|
%I #7 Jun 20 2022 20:47:39
%S 208,1212,1212,7056,6896,7056,41112,39188,39188,41112,239648,222988,
%T 217304,222988,239648,1397712,1269812,1207448,1207448,1269812,1397712,
%U 8156096,7237508,6716768,6556488,6716768,7237508,8156096,47619552
%N T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).
%C Table starts
%C 208 1212 7056 41112 239648 1397712
%C 1212 6896 39188 222988 1269812 7237508
%C 7056 39188 217304 1207448 6716768 37416120
%C 41112 222988 1207448 6556488 35656244 194284128
%C 239648 1269812 6716768 35656244 189641952 1011141204
%C 1397712 7237508 37416120 194284128 1011141204 5278556248
%C 8156096 41285540 208681224 1060310544 5401882616 27621051428
%C 47619552 235717236 1165446648 5797286912 28926522000
%C 278172288 1346930052 6516597192 31746284736
%C 1625861952 7703391252 36485687312
%H R. H. Hardin, <a href="/A234549/b234549.txt">Table of n, a(n) for n = 1..84</a>
%F Empirical for column k:
%F k=1: a(n) = 6*a(n-1) +34*a(n-2) -204*a(n-3) -40*a(n-4) +240*a(n-5).
%F k=2: [order 15].
%F k=3: [order 49].
%e Some solutions for n=2, k=4:
%e 0 4 0 5 0 0 3 2 4 4 0 2 5 5 3 3 4 1 5 0
%e 1 2 1 3 1 5 5 1 0 3 3 2 2 5 0 4 2 2 3 1
%e 4 2 4 3 4 4 1 0 2 2 5 1 4 4 2 1 2 5 3 4
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 28 2013
| 