Array read by antidiagonals: T(m,n) is the number of minimal edge cuts in the grid graph P_m X P_n.

Terms

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