Lower bounds for the maximum number of stable matchings in the stable marriage problem based on composing smaller instances.

A357271

Lower bounds for the maximum number of stable matchings in the stable marriage problem based on composing smaller instances.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =10a(4) =16a(5) =48a(6) =71a(7) =268a(8) =330a(9) =1000a(10) =1231a(11) =6472a(12) =6720a(13) =20176a(14) =25011a(15) =195472a(16) =200832a(17) =456300a(18) =637336a(19) =3419680a(20) =3506880a(21) =11221136a(22) =15481956a(23) =126112960a(24) =127885440a(25) =262860800a(26) =384418176a(27) =2000043808

External references