[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
Number of (n+1) X (3+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).
1

%I #6 Jun 20 2022 19:12:59

%S 13464,158288,1856768,22124316,260915944,3122368992,36940569778,

%T 443886085700,5267872223782,63565110955752,756696012118752,

%U 9169781418833544,109495524770067884,1332679274592188150

%N Number of (n+1) X (3+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="/A234493/b234493.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=2:

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

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

%e 2 5 1 5 1 4 1 5 2 2 3 1 4 3 2 3 4 2 2 2

%Y Column 3 of A234497.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 26 2013