195472

Appears in sequences

• a(0) = 1, a(1) = 2; thereafter a(n) = 3*a(n-1)^2 - 2*a(n-2)^4.at n=4A005154
• Number of stable matchings in a certain form of Pseudo-Latin squares of order n based on Latin subsquares.at n=15A069124
• A certain class of stable matchings.at n=15A069156
• Expansion of f(-x^2, -x^10) / f(-x, -x) in powers of x where f(, ) is Ramanujan's general theta function.at n=37A262984
• Lower bounds for the maximum number of stable matchings in the stable marriage problem based on composing smaller instances.at n=15A357271
• a(n) is the number of pseudo-Latin stable matchings in a particular matrix of size n (see Comments for detail).at n=15A371810