|
%I #6 Mar 06 2018 16:13:59
%S 0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,36,0,0,0,1,0,0,0,0,0,
%T 0,1,0,34,0,939,0,939,0,34,0,0,0,1173,0,0,0,0,1173,0,0,0,0,0,40899,0,
%U 0,0,40899,0,0,0,0,0,0,0,1696781,0,0,1696781,0,0,0,0,0,153,0,890989,0
%N T(n,m) = Number of ways to partition an n X m grid into 8 connected equal-area regions.
%H R. H. Hardin, <a href="/A167264/b167264.txt">Table of n, a(n) for n=1..112</a>
%K nonn,tabl
%O 1,25
%A _R. H. Hardin_, Oct 31 2009
|
