|
%I #7 Jun 19 2022 23:53:04
%S 168,848,4352,22576,117232,609412,3167392,16467664,85596352,445030452,
%T 2313215088,12026817096,62514004752,325021440292,1689424028512,
%U 8783616241536,45656226614400,237374848616996,1233847154123504
%N Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).
%H R. H. Hardin, <a href="/A235064/b235064.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 35*a(n-2) -235*a(n-4) +543*a(n-6) -458*a(n-8) +96*a(n-10).
%e Some solutions for n=5:
%e 1 6 3 4 0 2 4 6 0 4 3 5 5 0 0 1 4 3 0 1
%e 3 5 4 2 1 6 6 5 4 5 2 1 6 4 2 0 3 5 4 2
%e 4 3 5 0 0 2 4 6 6 4 0 2 4 5 3 4 4 3 2 3
%e 3 5 3 1 4 3 3 2 0 1 6 5 5 3 4 2 0 2 6 4
%e 4 3 1 2 0 2 4 6 4 2 2 4 1 2 2 3 1 0 1 2
%e 0 2 0 4 2 1 6 5 0 1 4 3 0 4 4 2 5 1 6 4
%Y Column 1 of A235071.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 03 2014
| 