|
%I #6 Jun 19 2022 01:51:46
%S 47936,1173940,31382488,877700068,25133134704,729604466884,
%T 21336968498856,627009808429332,18469535419340472,545113896765577704,
%U 16099953582167606184,475972286878459170524,14072893642290774269272
%N Number of (n+1) X (3+1) 0..6 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="/A234172/b234172.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1:
%e 4 3 3 5 2 5 5 2 5 6 2 0 3 2 5 3 6 4 1 0
%e 3 3 2 3 0 2 3 1 4 6 3 2 1 1 3 2 6 3 1 1
%Y Column 3 of A234175.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 20 2013
| 