login
Number of (n+1) X (4+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).
1

%I #7 Jun 20 2022 00:24:16

%S 4704,15572,51220,170568,569352,1912444,6442252,21811720,74044552,

%T 252514496,863227916,2963538436,10196465900,35222100660,121914919708,

%U 423563796488,1474316189604,5149747271896,18019152344164,63258132957568

%N Number of (n+1) X (4+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).

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

%e Some solutions for n=4:

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

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

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

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

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

%Y Column 4 of A235026.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 02 2014