11716571

Properties

Appears in sequences

• Number of simple connected graphs on n unlabeled nodes.at n=10A001349
• Number of 6-indecomposable (connected) graphs on n nodes.at n=10A128528
• Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.at n=45A201922
• Triangular array read by rows. T(n,k) is the number of unlabeled graphs on n nodes that have exactly k distinct components (n >= 1).at n=21A217955
• Triangular array read by rows. T(n,k) is the number of size k connected components over all simple unlabeled graphs with n nodes; n>=1,1<=k<=n.at n=54A224065
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with vertex-connectivity >= k.at n=56A327365
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs with n vertices and vertex-connectivity >= k.at n=56A327805
• Prime numbersat n=770650