10508108222
domain: N
Appears in sequences
- Number of connected graphs on n labeled nodes, each node being colored with one of 2 colors, such that no edge joins nodes of the same color.at n=10A002027
- Number of labeled connected digraphs on n nodes where every node has indegree 0 or outdegree 0 and no isolated nodes.at n=8A002031
- Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k connected components; n>=1, 1<=k<=n.at n=45A228892