|
%I #11 Jun 19 2022 01:03:24
%S 298,1820,11112,68086,417050,2564388,15760606,97264082,599847168,
%T 3715680490,22995724082,142980376236,887988916630,5541920176778,
%U 34537856122656,216342520763602,1352830192028858,8504211973522620
%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 4 (constant-stress 1 X 1 tilings).
%H R. H. Hardin, <a href="/A234659/b234659.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 11*a(n-1) + 17*a(n-2) - 492*a(n-3) + 1050*a(n-4) + 1260*a(n-5).
%F Empirical g.f.: 2*x*(149 - 729*x - 6987*x^2 + 30765*x^3 + 30870*x^4) / ((1 - 6*x)*(1 - 5*x - 5*x^2)*(1 - 42*x^2)). - _Colin Barker_, Oct 16 2018
%e Some solutions for n=4:
%e 1 0 0 4 5 5 3 5 6 6 1 3 2 1 6 0 3 4 4 4
%e 0 3 2 2 6 2 2 0 6 2 4 2 5 0 3 1 0 5 5 1
%e 5 4 0 4 6 6 1 3 1 1 4 6 6 5 3 5 3 4 1 1
%e 6 1 6 6 2 6 2 0 5 1 5 3 0 3 0 6 6 3 1 5
%e 1 0 6 2 3 3 2 4 6 6 6 0 5 4 3 5 1 2 4 4
%Y Column 1 of A234665.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 29 2013
| 