|
%I #7 Jun 18 2022 23:20:21
%S 96640,104988,115952,138744,172288,242592,358016,603216,1044640,
%T 2006448,3872192,8117424,16889248,38126832,84508736,205202736,
%U 481284640,1249786608,3069367232,8404486704,21326389408,60552997872,156864001856
%N Number of (n+1) X (9+1) 0..3 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 Column 9 of A235301.
%H R. H. Hardin, <a href="/A235299/b235299.txt">Table of n, a(n) for n = 1..25</a>
%F Empirical: a(n) = 3*a(n-1) +17*a(n-2) -57*a(n-3) -86*a(n-4) +372*a(n-5) +76*a(n-6) -972*a(n-7) +360*a(n-8) +864*a(n-9) -576*a(n-10).
%e Some solutions for n=5:
%e 2 0 3 0 3 0 3 1 3 0 3 2 0 1 3 2 3 2 3 0
%e 1 2 2 2 2 2 2 3 2 2 0 2 3 1 0 2 0 2 0 0
%e 2 0 3 0 3 0 3 1 3 0 3 2 0 1 3 2 3 2 3 0
%e 0 1 1 1 1 1 1 2 1 1 0 2 3 1 0 2 0 2 0 0
%e 2 0 3 0 3 0 3 1 3 0 3 2 0 1 3 2 3 2 3 0
%e 0 1 1 1 1 1 1 2 1 1 0 2 3 1 0 2 0 2 0 0
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 05 2014
| 