T(n,m) = Number of ways to partition an nXm grid into 3 connected equal-area regions.

Terms

a(0) =0a(1) =0a(2) =0a(3) =1a(4) =0a(5) =1a(6) =0a(7) =3a(8) =3a(9) =0a(10) =0a(11) =0a(12) =10a(13) =0a(14) =0a(15) =1a(16) =0a(17) =23a(18) =23a(19) =0a(20) =1a(21) =0a(22) =9a(23) =56a(24) =0a(25) =56a(26) =9a(27) =0a(28) =0a(29) =0