|
%I #6 Jun 20 2022 21:05:31
%S 360,2716,2716,20416,22458,20416,153752,184816,184816,153752,1157728,
%T 1527660,1659728,1527660,1157728,8726336,12632704,15022720,15022720,
%U 12632704,8726336,65777344,104793676,135896344,149584336,135896344
%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 3 (constant-stress 1 X 1 tilings).
%C Table starts
%C 360 2716 20416 153752 1157728
%C 2716 22458 184816 1527660 12632704
%C 20416 184816 1659728 15022720 135896344
%C 153752 1527660 15022720 149584336 1489279544
%C 1157728 12632704 135896344 1489279544 16292204064
%C 8726336 104793676 1236987584 14987310200 181336703944
%C 65777344 870061872 11259287952 150974940800 2016799098648
%C 496308128 7247511972 103178794676 1539878118344 22906568942748
%C 3744934912 60427123392 945421176696 15724391364084
%C 28286490944 505598378732 8728777849856
%H R. H. Hardin, <a href="/A234555/b234555.txt">Table of n, a(n) for n = 1..83</a>
%F Empirical for column k:
%F k=1: a(n) = 118*a(n-2) -3660*a(n-4) +10800*a(n-6).
%F k=2: [order 34].
%e Some solutions for n=2, k=4:
%e 0 2 3 2 6 0 3 6 6 6 0 4 1 2 4 0 0 4 3 4
%e 3 2 0 2 3 0 6 6 3 0 4 5 5 3 2 3 0 1 3 1
%e 0 2 3 2 0 0 3 6 6 0 4 2 5 0 2 2 2 6 5 0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 28 2013
| 