|
%I #6 Jun 20 2022 01:16:16
%S 95872,2765648,87871120,2941603932,101383587816,3555453917560,
%T 125966139330824,4492285883423076,160824570377394016,
%U 5773259968701864120,207553467686691838528,7471009938914959605184,269067241891021791894672
%N Number of (n+1) X (3+1) 0..7 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="/A234478/b234478.txt">Table of n, a(n) for n = 1..141</a>
%e Some solutions for n=1:
%e 6 1 0 2 5 5 6 7 3 7 1 2 1 1 5 7 7 5 7 7
%e 7 1 1 4 4 5 5 7 3 6 1 3 2 1 4 7 6 3 6 7
%Y Column 3 of A234481.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 26 2013
| 