|
%I #6 Jun 20 2022 20:31:01
%S 80,432,432,2368,3296,2368,13056,25728,25728,13056,71936,203008,
%T 287888,203008,71936,397056,1603680,3271560,3271560,1603680,397056,
%U 2188288,12713312,37234216,53812604,37234216,12713312,2188288,12079104,100679584
%N T(n,k) is the number of (n+1) X (k+1) 0..3 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 80 432 2368 13056 71936 397056
%C 432 3296 25728 203008 1603680 12713312
%C 2368 25728 287888 3271560 37234216 425662432
%C 13056 203008 3271560 53812604 886832036 14698619604
%C 71936 1603680 37234216 886832036 21167182224 508700005648
%C 397056 12713312 425662432 14698619604 508700005648 17748461638244
%C 2188288 100679584 4858165384 243143542208 12196560180032 617580751794644
%C 12079104 799588512 55631535036 4038567639984 293794019734704 21603778650646796
%H R. H. Hardin, <a href="/A234333/b234333.txt">Table of n, a(n) for n = 1..143</a>
%F Empirical for column k:
%F k=1: a(n) = 32*a(n-2) -48*a(n-4).
%F k=2: [order 11].
%F k=3: [order 48].
%e Some solutions for n=2, k=4:
%e 2 0 1 2 3 0 0 0 2 3 0 2 1 1 0 0 0 1 3 3
%e 2 1 1 1 1 2 1 0 3 3 2 3 3 2 2 1 0 0 1 2
%e 2 2 1 2 1 2 2 0 2 3 0 2 1 1 0 2 0 1 1 1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 23 2013
| 