|
%I #6 Jun 20 2022 20:55:23
%S 298,1820,1820,11112,9774,11112,68086,52646,52646,68086,417050,286668,
%T 250792,286668,417050,2564388,1566596,1219652,1219652,1566596,2564388,
%U 15760606,8659270,5969944,5359466,5969944,8659270,15760606,97264082
%N T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).
%C Table starts
%C 298 1820 11112 68086 417050 2564388
%C 1820 9774 52646 286668 1566596 8659270
%C 11112 52646 250792 1219652 5969944 29828832
%C 68086 286668 1219652 5359466 23814574 109044744
%C 417050 1566596 5969944 23814574 96408730 406314140
%C 2564388 8659270 29828832 109044744 406314140 1591037136
%C 15760606 48048220 150093796 504872642 1736939430 6340767776
%C 97264082 269752200 770712800 2403596054 7695605586 26370069748
%C 599847168 1520415050 3987209216 11568505044 34563948112
%C 3715680490 8671291020 21036841216 57131064334
%H R. H. Hardin, <a href="/A234665/b234665.txt">Table of n, a(n) for n = 1..97</a>
%F Empirical for column k:
%F k=1: a(n) = 11*a(n-1) +17*a(n-2) -492*a(n-3) +1050*a(n-4) +1260*a(n-5).
%F k=2: [order 16].
%F k=3: [order 39].
%e Some solutions for n=2, k=4:
%e 3 3 5 4 5 4 4 4 5 0 0 0 6 3 3 4 4 2 6 5
%e 1 5 3 6 3 1 5 1 6 5 5 1 3 4 0 4 0 2 2 5
%e 2 2 4 3 4 0 0 0 1 4 3 3 1 6 6 0 0 6 2 1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 29 2013
| 