Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #6 Jun 20 2022 20:49:52
%S 412,3710,3710,33720,44826,33720,307598,549448,549448,307598,2802904,
%T 6788640,9120608,6788640,2802904,25588052,83845322,153306026,
%U 153306026,83845322,25588052,233283984,1039633348,2571461348,3523122268,2571461348
%N T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 2 (constant-stress 1 X 1 tilings).
%C Table starts
%C 412 3710 33720 307598 2802904
%C 3710 44826 549448 6788640 83845322
%C 33720 549448 9120608 153306026 2571461348
%C 307598 6788640 153306026 3523122268 80718738808
%C 2802904 83845322 2571461348 80718738808 2520220543472
%C 25588052 1039633348 43400523142 1866058872810 79661836246626
%C 233283984 12874230598 730012705548 42943618264812
%C 2130704612 160028488122 12351551016378
%C 19434069328 1986351882576
%C 177586235768
%H R. H. Hardin, <a href="/A234190/b234190.txt">Table of n, a(n) for n = 1..60</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 7].
%F k=2: [order 35].
%e Some solutions for n=2, k=4:
%e 0 5 1 1 5 0 4 2 5 6 0 4 5 4 4 0 5 6 2 6
%e 0 3 1 3 5 0 2 2 3 2 0 2 1 2 4 0 3 2 0 6
%e 0 5 1 1 1 0 4 2 5 6 1 1 2 1 5 3 4 1 1 5
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Dec 20 2013