4803129

Appears in sequences

• Number of simple labeled graphs on n nodes with exactly 1 connected component that is a tree or a cycle.at n=8A215851
• Number T(n,k) of simple labeled graphs on n nodes with exactly k connected components that are trees or cycles; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=46A215861