2086099

Appears in sequences

• Number of labeled connected bipartite graphs on n nodes.at n=7A001832
• Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.at n=28A228859
• Triangle read by rows: T(n,k) is the number of k-colored connected graphs on n labeled nodes up to permutation of the colors.at n=29A322278