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

%I #6 Jun 20 2022 18:20:40

%S 32,120,448,1680,6272,23520,87808,329280,1229312,4609920,17210368,

%T 64538880,240945152,903544320,3373232128,12649620480,47225249792,

%U 177094686720,661153497088,2479325614080,9256148959232,34710558597120

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

%C Column 1 of A234443.

%H R. H. Hardin, <a href="/A234436/b234436.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 14*a(n-2).

%e Some solutions for n=5:

%e 0 1 1 0 0 1 2 1 0 1 1 0 0 0 1 1 0 1 2 0

%e 0 0 2 2 0 0 0 0 0 2 1 1 1 0 1 0 2 2 1 0

%e 1 2 1 2 2 1 1 2 0 1 2 1 2 2 2 2 0 1 2 2

%e 0 0 0 2 2 2 1 1 0 0 2 0 0 1 2 1 0 0 2 1

%e 0 1 0 1 2 1 2 1 0 1 1 0 1 1 2 2 2 1 0 0

%e 1 1 0 0 0 0 1 1 2 2 1 1 1 2 0 1 2 0 1 2

%Y Column 1 of A234443.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 26 2013