login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A344669 a(n) is the number of preference profiles in the stable marriage problem with n men and n women that generate the maximum possible number of stable matchings. 3

%I

%S 1,2,1092,144

%N a(n) is the number of preference profiles in the stable marriage problem with n men and n women that generate the maximum possible number of stable matchings.

%C A069124(n) provides the lower bound for the maximum number of stable matchings with n men and n women. It is exact for n below 5. For example, the maximum possible number of stable matchings for n=4 is 10.

%e For n=2, there are 16 possible preference profiles: 14 of them generate one stable matching and 2 of them generate two stable matchings. Thus, a(2) = 2.

%Y Cf. A069124, A185141, A344666, A344667, A344668.

%K nonn,bref,more

%O 1,2

%A _Tanya Khovanova_ and MIT PRIMES STEP Senior group, May 27 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 28 23:12 EST 2022. Contains 350670 sequences. (Running on oeis4.)