200832

Appears in sequences

• Number of stable matchings in a certain form of Pseudo-Latin squares of order n based on Latin subsquares.at n=16A069124
• A certain class of stable matchings.at n=16A069156
• The number of squares with vertices from the vertices of the n-dimensional hypercube.at n=9A345340
• Triangle read by rows: T(n,k) is the number of ways of choosing a k-dimensional cube from the vertices of an n-dimensional hypercube; 0 <= k <= n.at n=47A346905
• Lower bounds for the maximum number of stable matchings in the stable marriage problem based on composing smaller instances.at n=16A357271
• a(n) is the number of pseudo-Latin stable matchings in a particular matrix of size n (see Comments for detail).at n=16A371810