|
%I #13 Jun 20 2022 21:32:01
%S 250,1834,13464,99142,728536,5368636,39476802,291119578,2142048610,
%T 15807820384,116387461374,859523654392,6332338846996,46797181439986,
%U 344979511889562,2551214650069978,18818390917298920,139260488424222934
%N Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).
%H R. H. Hardin, <a href="/A234491/b234491.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 5*a(n-1) + 74*a(n-2) - 295*a(n-3) - 1008*a(n-4) + 840*a(n-5).
%F Empirical g.f.: 2*x*(125 + 292*x - 7103*x^2 - 15072*x^3 + 14760*x^4) / ((1 - 56*x^2)*(1 - 5*x - 18*x^2 + 15*x^3)). - _Colin Barker_, Oct 15 2018
%e Some solutions for n=4:
%e 4 2 4 5 2 2 2 4 2 4 2 1 3 1 0 1 3 4 5 2
%e 1 1 2 5 3 5 1 1 5 5 5 2 3 3 4 3 1 0 2 1
%e 4 2 0 1 2 2 0 2 1 3 4 3 3 1 4 1 3 0 4 1
%e 4 4 5 4 2 4 4 4 2 2 3 4 3 3 4 3 3 2 5 0
%e 5 3 1 2 5 5 3 1 1 3 2 1 1 3 3 4 4 1 4 1
%Y Column 1 of A234497.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 26 2013
| 