|
%I #10 Jun 20 2022 21:32:49
%S 432,3296,25728,203008,1603680,12713312,100679584,799588512,
%T 6341424800,50436411040,400533940512,3190038587424,25365477524640,
%U 202291348481184,1610482677443104,12860140933119776,102502504089127840
%N Number of (n+1) X (2+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1 (constant-stress 1 X 1 tilings).
%H R. H. Hardin, <a href="/A234327/b234327.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 10*a(n-1) +59*a(n-2) -768*a(n-3) +608*a(n-4) +7580*a(n-5) -11628*a(n-6) -18088*a(n-7) +32880*a(n-8) +3232*a(n-9) -17600*a(n-10) +4224*a(n-11).
%e Some solutions for n=3:
%e 3 2 2 0 0 1 3 2 1 1 1 0 2 2 3 1 3 2 2 2 0
%e 0 0 1 1 2 2 1 1 1 2 3 3 0 1 1 1 2 0 2 1 0
%e 2 3 3 2 2 3 2 1 0 2 2 3 0 2 1 2 2 1 3 3 3
%e 0 0 1 0 1 1 3 3 1 3 2 2 0 3 3 3 2 2 2 3 2
%Y Column 2 of A234333.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 23 2013
| 