Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Oct 02 2021 10:24:08
%S 192960,9136352,9136352,433713824,1292583020,433713824,20581985952,
%T 184351404608,184351404608,20581985952,976666568320,26257519475028,
%U 79410378172576,26257519475028,976666568320,46345923682624
%N T(n,k) = Number of (n+2) X (k+2) 0..3 arrays with no 2 X 2 subblock sum equal to any diagonal or antidiagonal neighbor 2 X 2 subblock sum.
%C Table starts
%C .........192960..........9136352.........433713824.......20581985952
%C ........9136352.......1292583020......184351404608....26257519475028
%C ......433713824.....184351404608....79410378172576.34116783462382978
%C ....20581985952...26257519475028.34116783462382978
%C ...976666568320.3739210796619416
%C .46345923682624
%H R. H. Hardin, <a href="/A187676/b187676.txt">Table of n, a(n) for n = 1..23</a>
%e Some solutions for 5 X 4
%e ..0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0
%e ..0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0
%e ..2..2..0..2....0..2..0..2....0..2..0..2....2..2..0..2....0..2..0..1
%e ..1..1..3..3....0..2..3..0....1..1..0..2....1..1..0..1....0..3..3..1
%e ..0..0..1..0....1..1..2..0....3..3..2..3....3..0..1..2....1..2..2..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 12 2011