8820864

Appears in sequences

• Number of stable matchings in a certain form of Pseudo-Latin squares of order n based on Latin subsquares.at n=22A069124
• G.f. satisfies: A(x) = x + A(A(A(A(x)^2))).at n=12A141380
• a(n) = 27225*n^2 - 2*n.at n=17A157814
• a(n) is the least number k such that both k and k + s have n prime divisors, counted with multiplicity, where s is the sum of the decimal digits of k.at n=11A382996