%I #6 Jun 20 2022 21:16:07
%S 160,760,760,3456,4024,3456,16572,20404,20404,16572,76032,115924,
%T 113288,115924,76032,365024,625480,743436,743436,625480,365024,
%U 1676576,3640580,4634504,5941320,4634504,3640580,1676576,8050184,19965444,32110856
%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 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).
%C Table starts
%C 160 760 3456 16572 76032 365024
%C 760 4024 20404 115924 625480 3640580
%C 3456 20404 113288 743436 4634504 32110856
%C 16572 115924 743436 5941320 44518632 385262124
%C 76032 625480 4634504 44518632 399820568 4244726408
%C 365024 3640580 32110856 385262124 4244726408 57645698844
%C 1676576 19965444 208211944 3064189932 41268054688 700047980248
%C 8050184 117487100 1482491852 27702518548 464573800208 10265376879740
%C 36980544 648180128 9763925800 225962416092 4675921747384 130326665117372
%C 177566656 3842929120 70741188392 2102864178560 54793760749712
%H R. H. Hardin, <a href="/A234898/b234898.txt">Table of n, a(n) for n = 1..112</a>
%F Empirical for column k:
%F k=1: a(n) = 30*a(n-2) -194*a(n-4) +428*a(n-6) -288*a(n-8) +48*a(n-10).
%F k=2: [order 51].
%e Some solutions for n=3, k=4:
%e 3 5 1 6 3 3 5 4 5 2 4 5 4 6 4 4 6 4 5 2
%e 0 3 0 4 0 0 3 1 3 1 0 2 0 1 0 0 1 0 2 0
%e 1 5 1 6 3 2 6 3 6 5 4 5 2 4 2 3 5 3 6 3
%e 0 3 0 4 2 0 5 1 3 1 2 4 0 3 0 2 3 0 4 0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 01 2014
|