login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of (n+1) X (n+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).
0

%I #6 Jun 20 2022 18:21:27

%S 32,582,17200,896112,72539432,11533082488,2561421896376,

%T 1379501791207360,834355608891492928,1756003516595468503128

%N Number of (n+1) X (n+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).

%e Some solutions for n=3:

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

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

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

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

%Y Diagonal of A234443.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 26 2013