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!)
A368433 a(n) is the number of reduced instances in the stable marriage problem of order n that generate the maximum possible number of stable matchings. 2
1, 1, 91, 1, 176130 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Reduced instances (A351409) are fewer than all instances by a factor of n!(n-1)! due to participant-renaming isomorphism, analogous to reduced latin squares.
For n in [1,2,4], a(n) = 1 showing uniqueness up to isomorphism.
LINKS
David F. Manlove, Algorithmics of Matching Under Preferences, World Scientific (2013) [Section 2.2.2].
FORMULA
a(n) = A344669(n) / A010790(n-1).
a(4) = A351430(10).
a(5) = A368419(0).
CROSSREFS
Cf. A344669 (unreduced), A351430 (order 4), A368419 (order 5), A351409 (total reduced instances), A010790 (reduction factor offset by 1).
Sequence in context: A172756 A306304 A175690 * A283896 A284439 A364664
KEYWORD
nonn,more,hard
AUTHOR
Dan Eilers, Dec 24 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 4 08:59 EDT 2024. Contains 373986 sequences. (Running on oeis4.)