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.

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.

Terms

    a(0) =1a(1) =1a(2) =91a(3) =1a(4) =176130

External references