|
%I #7 Jun 18 2022 23:38:41
%S 1888,2556,3536,5784,9568,18624,35936,79728,172288,420816,983456,
%T 2575824,6335488,17408784,44189216,125260368,323970688,936469776,
%U 2449052576,7166397264,18866545408,55638307344,147078545696,435949117008
%N Number of (n+1) X (5+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 5 of A235301.
%H R. H. Hardin, <a href="/A235295/b235295.txt">Table of n, a(n) for n = 1..210</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 3 0 2 3 1 0 0 3 0 3 3 3 0 2 3 1 3 1 2 2 2 1 3 2
%e 3 3 2 0 1 3 3 3 3 3 0 3 3 2 0 1 0 1 0 3 0 2 1 3
%e 3 0 2 3 1 0 3 0 3 0 0 0 0 2 3 1 3 1 1 1 1 0 2 1
%e 3 3 2 0 1 3 0 0 0 0 3 0 3 2 0 1 0 1 0 3 0 2 1 3
%e 3 0 2 3 1 0 3 0 3 0 0 0 0 2 3 1 3 1 1 1 1 0 2 1
%e 3 3 2 0 1 3 0 0 0 0 3 0 3 2 0 1 0 1 0 3 0 2 1 3
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 05 2014
| 