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.
%I A368433 #7 Jan 01 2024 13:30:44 %S A368433 1,1,91,1,176130 %N 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. %C A368433 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. %C A368433 For n in [1,2,4], a(n) = 1 showing uniqueness up to isomorphism. %H A368433 David F. Manlove, <a href="https://doi.org/10.1142/8591">Algorithmics of Matching Under Preferences</a>, World Scientific (2013) [Section 2.2.2]. %F A368433 a(n) = A344669(n) / A010790(n-1). %F A368433 a(4) = A351430(10). %F A368433 a(5) = A368419(0). %Y A368433 Cf. A344669 (unreduced), A351430 (order 4), A368419 (order 5), A351409 (total reduced instances), A010790 (reduction factor offset by 1). %K A368433 nonn,more,hard %O A368433 1,3 %A A368433 _Dan Eilers_, Dec 24 2023