58746304

Appears in sequences

• Triangle read by rows: T(n,k) (1 <= k <= n) = number of irreducible coverings by edges of the complete bipartite graph K_{n,k}.at n=35A210654
• Number of irreducible coverings by edges of the complete bipartite graph K_{n,n}; main diagonal of A210654.at n=7A210655