|
%I #3 Mar 31 2012 12:35:36
%S 0,0,0,1,0,1,0,3,3,0,0,0,10,0,0,1,0,23,23,0,1,0,9,56,0,56,9,0,0,0,132,
%T 0,0,132,0,0,1,0,259,1787,0,1787,259,0,1,0,19,546,0,22889,22889,0,546,
%U 19,0,0,0,1095,0,0,264500,0,0,1095,0,0,1,0,2043,72105,0
%N T(n,m) = Number of ways to partition an nXm grid into 3 connected equal-area regions.
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_ Oct 31 2009
|
