%I #3 Mar 31 2012 12:35:36
%S 0,1,1,0,2,0,1,3,3,1,0,4,0,4,0,1,5,19,19,5,1,0,6,0,70,0,6,0,1,7,85,
%T 245,245,85,7,1,0,8,0,856,0,856,0,8,0,1,9,355,2967,8171,8171,2967,355,
%U 9,1,0,10,0,10164,0,80518,0,10164,0,10,0,1,11,1435,34463,277969
%N Square array read by antidiagonals: T(n,m) = number of ways to partition an nXm grid into 2 connected equal-area regions.
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_, Nov 01 2009