%N 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.
%C 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.
%e 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.
%Y Cf. A069124, A185141, A344666, A344667, A344668.
%A _Tanya Khovanova_ and MIT PRIMES STEP Senior group, May 27 2021