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.

Showing 1-2 of 2 results.

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.

Original entry on oeis.org

1, 1, 91, 1, 176130
Offset: 1

Views

Author

Dan Eilers, Dec 24 2023

Keywords

Comments

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.
For n in [1,2,4], a(n) = 1 showing uniqueness up to isomorphism.

Links

Crossrefs

Cf. A344669 (unreduced), A351430 (order 4), A368419 (order 5), A351409 (total reduced instances), A010790 (reduction factor offset by 1).

Formula

a(n) = A344669(n) / A010790(n-1).
a(4) = A351430(10).
a(5) = A368419(0).

A369597 a(n) is the number of reduced stable marriage problem instances of order 3 that generate n possible stable matchings.

Original entry on oeis.org

2840, 957, 91
Offset: 1

Views

Author

Dan Eilers, Jan 27 2024

Keywords

Crossrefs

Cf. A351430 (order 4, reduced), A368419 (order 5, reduced).
Cf. A344666 (order 3 unreduced), A344667 (order 4 unreduced).
Cf. A351409 (number of reduced instances of order n).
Cf. A010790 (reduction factor for order n).
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.