|
%I #4 Mar 31 2012 12:35:36
%S 0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,8,0,0,8,0,0,0,62,0,62,0,0,0,0,0,454,
%T 454,0,0,0,0,0,0,0,4006,0,0,0,0,1,0,0,0,33344,33344,0,0,0,1,0,64,0,0,
%U 270827,0,270827,0,0,64,0,0,0,8072,0,2152050,0,0,2152050,0,8072,0,0,0,0,0
%N T(n,m) = Number of ways to partition an nXm grid into 5 connected equal-area regions.
%H R. H. Hardin, <a href="/A167261/b167261.txt">Table of n, a(n) for n=1..110</a>
%K nonn,tabl
%O 1,17
%A _R. H. Hardin_ Oct 31 2009
|
