Array read by antidiagonals: T(m,n) is the number of minimal edge cuts in the rook graph K_m X K_n.

Terms

a(0) =0a(1) =1a(2) =1a(3) =3a(4) =6a(5) =3a(6) =7a(7) =22a(8) =22a(9) =7a(10) =15a(11) =84a(12) =150a(13) =84a(14) =15a(15) =31a(16) =346a(17) =1276a(18) =1276a(19) =346a(20) =31a(21) =63a(22) =1476a(23) =11538a(24) =23214a(25) =11538a(26) =1476a(27) =63a(28) =127a(29) =6322