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.

A069124 Number of stable matchings in a certain form of Pseudo-Latin squares of order n based on Latin subsquares.

Original entry on oeis.org

1, 2, 3, 10, 12, 32, 42, 268, 288, 656, 924, 4360, 3816, 11336, 13536, 195472, 200832, 423104, 618576, 2404960, 2506464, 6994784, 8820864, 85524160, 60669696, 145981952, 194348448, 1073479840
Offset: 1

Views

Author

N. J. A. Sloane, Apr 12 2002

Keywords

Comments

a(n) is from Table 1 of Thurber's linked paper. The particular form of Pseudo-Latin squares is based on upper-left subsquares of the power-of-2 Latin squares of A005154, defined as G(n) in Section 3 of Thurber's paper. - Dan Eilers, May 16 2025
There is a possibility that some of the terms in this sequence from a(7) onward are incorrect. See A371810 for an alternative. - Sean A. Irvine, Apr 16 2024
a(7)=42 verified using MiniZinc, see linked file with details. - Dan Eilers, May 14 2025

Crossrefs

Cf. A371810.
Cf. A005154 (power-of-2 Latin squares used as basis for subsquares). - Dan Eilers, May 16 2025

Extensions

Name edited by Dan Eilers, May 16 2025