Number of stable matchings in a certain form of Pseudo-Latin squares of order n based on Latin subsquares.

A069124

Number of stable matchings in a certain form of Pseudo-Latin squares of order n based on Latin subsquares.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =10a(4) =12a(5) =32a(6) =42a(7) =268a(8) =288a(9) =656a(10) =924a(11) =4360a(12) =3816a(13) =11336a(14) =13536a(15) =195472a(16) =200832a(17) =423104a(18) =618576a(19) =2404960a(20) =2506464a(21) =6994784a(22) =8820864a(23) =85524160a(24) =60669696a(25) =145981952a(26) =194348448a(27) =1073479840

External references