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

Terms

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