4148839domain: NAppears in sequencesNumber of edge cuts in the n-ladder graph P_2 X P_n.at n=7A359987Array read by antidiagonals: T(m,n) is the number of edge cuts in the grid graph P_m X P_n.at n=37A359990Array read by antidiagonals: T(m,n) is the number of edge cuts in the grid graph P_m X P_n.at n=43A359990