|
%I #6 Jun 20 2022 21:14:47
%S 672,7840,7840,95872,141728,95872,1200640,2765648,2765648,1200640,
%T 15217152,56172656,87871120,56172656,15217152,194145280,1165600828,
%U 2941603932,2941603932,1165600828,194145280,2484815872,24484032192
%N T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).
%C Table starts
%C 672 7840 95872 1200640 15217152
%C 7840 141728 2765648 56172656 1165600828
%C 95872 2765648 87871120 2941603932 101383587816
%C 1200640 56172656 2941603932 163999261180 9478559277180
%C 15217152 1165600828 101383587816 9478559277180 924511268818064
%C 194145280 24484032192 3555453917560 560119617963572 92612141125166316
%C 2484815872 517788509004 125966139330824 33549726037031472
%H R. H. Hardin, <a href="/A234481/b234481.txt">Table of n, a(n) for n = 1..60</a>
%F Empirical for column k:
%F k=1: a(n) = 224*a(n-2) -10304*a(n-4) +96256*a(n-6) -80640*a(n-8).
%F k=2: [order 46].
%e Some solutions for n=2, k=4:
%e 0 4 6 0 1 4 4 6 2 2 4 4 6 7 4 4 4 6 1 3
%e 0 5 6 1 3 0 1 4 1 0 0 1 4 6 4 4 5 6 2 5
%e 0 6 6 2 5 0 0 4 0 0 0 2 4 7 6 2 4 4 1 5
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 26 2013
| 