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!)
A069124 Pseudo-Latin stable matchings. 2
1, 2, 3, 10, 12, 32, 42, 268, 288, 656, 924, 4360, 3816, 11336, 13536, 195472, 200832, 423104, 618576, 2404960, 2506464, 6994784, 8820864, 85524160, 60669696, 145981952, 194348448, 1073479840 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Matvey Borodin, Eric Chen, Aidan Duncan, Tanya Khovanova, Boyan Litchev, Jiahe Liu, Veronika Moroz, Matthew Qian, Rohith Raghavan, Garima Rastogi, and Michael Voigt, The Stable Matching Problem and Sudoku, arXiv:2108.02654 [math.HO], 2021.

E. G. Thurber, Concerning the maximum number of stable matchings in the stable marriage problem, Discrete Math., 248 (2002), 195-219.

CROSSREFS

Sequence in context: A004679 A168060 A306076 * A218028 A067769 A066089

Adjacent sequences:  A069121 A069122 A069123 * A069125 A069126 A069127

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Apr 12 2002

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 January 24 00:05 EST 2022. Contains 350515 sequences. (Running on oeis4.)