T(m,n) is the number of suitably connected m X n Legendrian mosaics read by rows, with 1<=n<=m.

Terms

a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =20a(6) =1a(7) =8a(8) =104a(9) =1504a(10) =1a(11) =16a(12) =544a(13) =22208a(14) =948032a(15) =1a(16) =32a(17) =2848a(18) =329216a(19) =40930304a(20) =5204262912a(21) =1a(22) =64a(23) =14912a(24) =4883968a(25) =1772261888a(26) =666548862976a(28) =1a(29) =128a(30) =78080