login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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 1 (constant-stress 1 X 1 tilings).
1

%I #6 Jun 20 2022 01:30:31

%S 192960,6049248,207310120,7432565004,272404175456,10112283614188,

%T 377695247179700,14168309891795076,532341726397811068,

%U 20038937366037061360,754496816963042860868,28439800055132805462404

%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 1 (constant-stress 1 X 1 tilings).

%H R. H. Hardin, <a href="/A234455/b234455.txt">Table of n, a(n) for n = 1..98</a>

%e Some solutions for n=1:

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

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

%Y Column 4 of A234458.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 26 2013