login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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
1, 2, 1092, 144 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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.

LINKS

Table of n, a(n) for n=1..4.

EXAMPLE

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.

CROSSREFS

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

Sequence in context: A108963 A152510 A324590 * A321633 A244550 A039951

Adjacent sequences:  A344666 A344667 A344668 * A344670 A344671 A344672

KEYWORD

nonn,bref,more

AUTHOR

Tanya Khovanova and MIT PRIMES STEP Senior group, May 27 2021

STATUS

approved

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 December 4 19:40 EST 2021. Contains 349526 sequences. (Running on oeis4.)