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

%I #6 Jun 20 2022 18:08:57

%S 31064,159004,706992,4616452,26272908,198069616,1249781316,

%T 10302188956,68182126892,598458783660,4061087277028,37320220056152,

%U 256928073051092,2440338300882200,16949368737198628,164723686282956960

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

%H R. H. Hardin, <a href="/A234888/b234888.txt">Table of n, a(n) for n = 1..112</a>

%e Some solutions for n=2:

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

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

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

%Y Column 6 of A234890.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 01 2014