A167264 T(n,m) = Number of ways to partition an n X m grid into 8 connected equal-area regions.
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, 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, 0, 0, 40899, 0, 0, 0, 0, 0, 0, 0, 1696781, 0, 0, 1696781, 0, 0, 0, 0, 0, 153, 0, 890989, 0
Offset: 1
Links
- R. H. Hardin, Table of n, a(n) for n=1..112