1121568

Appears in sequences

• Triangular array read by rows: T(n,k) is the number of rooted labeled simple graphs on {1,2,...,n} such that the root is in a component of size k; n>=1, 1<=k<=n.at n=26A228315
• Number of leaves in all simple labeled connected graphs on n nodes.at n=7A275462
• Triangle read by rows. T(n, k) = A360604(n, k) * A001187(k) for 0 <= k <= n.at n=42A360603