A369597 a(n) is the number of reduced stable marriage problem instances of order 3 that generate n possible stable matchings.
2840, 957, 91
Offset: 1
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.