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

Terms

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