%I #4 Mar 31 2012 12:35:36
%S 0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,0,11,11,0,1,0,13,0,0,0,13,0,0,0,170,
%T 0,0,170,0,0,0,0,0,2003,0,2003,0,0,0,0,41,997,0,27950,27950,0,997,41,
%U 0,0,0,0,0,0,451206,0,0,0,0,0,1,0,7670,244252,0,6633399,6633399,0,244252,7670,0
%N T(n,m) = Number of ways to partition an nXm grid into 6 connected equal-area regions.
%H R. H. Hardin, <a href="/A167262/b167262.txt">Table of n, a(n) for n=1..110</a>
%K nonn,tabl
%O 1,18
%A _R. H. Hardin_ Oct 31 2009