311465
domain: N
Appears in sequences
- Number of n-node connected unicyclic graphs.at n=13A001429
- Array read by columns: T(n,m) = number of unlabeled graphs with n vertices and m unicyclic components.at n=35A137918
- Number of unlabeled disconnected P-series with n elements.at n=15A349488
- Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3).at n=52A381467