9743542

Appears in sequences

• Number of unlabeled nonseparable (or 2-connected) graphs (or blocks) with n nodes.at n=9A002218
• Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k articulation vertices, (0 <= k <= n).at n=55A325111
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with vertex-connectivity >= k.at n=57A327365
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs with n vertices and vertex-connectivity >= k.at n=57A327805