|
%I #11 Feb 11 2022 12:13:29
%S 65867261184,35927285472,7303612896,861578352,111479616,3478608,
%T 581472,36432,0,144
%N a(n) is the number of preference profiles in the stable marriage problem with 4 men and 4 women that generate n possible stable matchings.
%C A185141(n) is the total number of preference profiles for n men and n women.
%C A185141(4) = 110075314176 is the sum of the terms of this sequence.
%C For 2 men and 2 women, the total number of preference profiles is 16, where 14 profiles have 1 stable matching, and 2 profiles have 2 stable matchings.
%C For 3 men and 3 women, the total number of preference profiles is 46656, where the number of possible stable matchings ranges from 1 to 3. The distribution is provided by sequence A344666(n).
%H Matvey Borodin, Eric Chen, Aidan Duncan, Tanya Khovanova, Boyan Litchev, Jiahe Liu, Veronika Moroz, Matthew Qian, Rohith Raghavan, Garima Rastogi, and Michael Voigt, <a href="https://arxiv.org/abs/2201.00645">Sequences of the Stable Matching Problem</a>, arXiv:2201.00645 [math.HO], 2021.
%Y Cf. A185141, A344666, A344668, A344669.
%K nonn,fini,full
%O 1,1
%A _Tanya Khovanova_ and MIT PRIMES STEP Senior group, May 27 2021
|
