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 #5 Mar 31 2012 12:36:04
%S 256,3516,3516,49342,158806,49342,687900,7232034,7232034,687900,
%T 9599032,328811578,1079255234,328811578,9599032,133932498,14927163064,
%U 160170012852,160170012852,14927163064,133932498,1868731400,678146728482
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock determinant equal to any horizontal or vertical neighbor 2X2 subblock determinant
%C Table starts
%C .........256...........3516............49342............687900
%C ........3516.........158806..........7232034.........328811578
%C .......49342........7232034.......1079255234......160170012852
%C ......687900......328811578.....160170012852....77659127557452
%C .....9599032....14927163064...23757227154988.37582792498003078
%C ...133932498...678146728482.3524972742682648
%C ..1868731400.30800191295066
%C .26074015256
%H R. H. Hardin, <a href="/A185923/b185923.txt">Table of n, a(n) for n = 1..40</a>
%e Some solutions for 4X3
%e ..0..2..0....0..2..0....0..1..0....0..3..0....0..1..0....0..1..0....0..2..0
%e ..1..0..3....1..0..3....1..0..2....1..0..2....2..0..1....2..2..2....3..0..3
%e ..0..3..2....0..3..1....3..1..0....1..3..3....2..2..1....1..3..3....1..2..2
%e ..0..0..1....2..1..3....0..3..1....3..1..2....2..1..0....2..3..1....1..1..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Feb 06 2011