cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A344666 #13 Feb 11 2022 12:13:21
%S A344666 34080,11484,1092
%N A344666 a(n) is the number of preference profiles in the stable marriage problem with 3 men and 3 women that generate n possible stable matchings.
%C A344666 A185141(n) is the total number of preference profiles for n men and n women.
%C A344666 A185141(3) = 46656 is the sum of the terms of this sequence.
%C A344666 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 A344666 For 4 men and 4 women, the total number of preference profiles is 110075314176, where the number of possible stable matchings ranges from 1 to 10, excluding 9. The distribution is provided by sequence A344667(n).
%H A344666 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 A344666 Cf. A185141, A344667, A344668, A344669.
%K A344666 nonn,bref,fini,full
%O A344666 1,1
%A A344666 _Tanya Khovanova_ and MIT PRIMES STEP Senior group, May 27 2021