The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #6 Jun 20 2022 15:46:30
%S 3456,20404,113288,743436,4634504,32110856,208211944,1482491852,
%T 9763925800,70741188392,469704123072,3449044260864,23022329803976,
%U 170950844777056,1145540286614792,8587053971274908,57714312161683112
%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, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).
%H R. H. Hardin, <a href="/A234893/b234893.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=3:
%e 4 6 5 2 2 0 4 1 3 0 2 0 1 4 0 2 5 3 6 5
%e 1 4 2 0 6 3 6 2 5 3 6 3 3 5 2 5 3 0 2 0
%e 4 6 5 4 2 0 4 1 4 1 5 1 1 4 0 2 5 3 6 5
%e 1 4 2 0 6 3 6 2 5 3 6 3 2 6 1 4 3 0 2 0
%Y Column 3 of A234898.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 01 2014