50680432112
domain: N
Appears in sequences
- Number of labeled connected graphs with n nodes and 0 cutpoints (blocks or nonseparable graphs).at n=8A013922
- Regular triangle where T(n,k) is the number of labeled connected graphs on n + 1 vertices with k maximal blobs (2-connected components).at n=28A317671
- Triangle read by rows: T(n,k) is the number of simple connected graphs on n labeled nodes with k articulation vertices, (0 <= k <= n).at n=45A370064