login
Number of (n+1) X (3+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).
1

%I #6 Jun 19 2022 23:41:26

%S 48592,635904,8260920,108591688,1418241440,18729039912,245685138024,

%T 3261204356760,42973192245160,573587040137608,7594066023919576,

%U 101963002303378792,1356695275793927016,18330899102362639544

%N Number of (n+1) X (3+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).

%H R. H. Hardin, <a href="/A234230/b234230.txt">Table of n, a(n) for n = 1..135</a>

%e Some solutions for n=1:

%e 7 2 3 1 0 3 4 4 3 4 5 2 2 1 0 1 6 3 5 2

%e 4 2 6 7 4 4 2 5 0 4 2 2 1 3 5 3 7 7 6 0

%Y Column 3 of A234233.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 21 2013