Square array read by antidiagonals: T(m,n) = number of spanning trees in C_m X C_n.

Terms

a(0) =1a(1) =2a(2) =2a(3) =3a(4) =32a(5) =3a(6) =4a(7) =294a(8) =294a(9) =4a(10) =5a(11) =2304a(12) =11664a(13) =2304a(14) =5a(15) =6a(16) =16810a(17) =367500a(18) =367500a(19) =16810a(20) =6a(21) =7a(22) =117600a(23) =10609215a(24) =42467328a(25) =10609215a(26) =117600a(27) =7a(28) =8a(29) =799694