1006700565

Appears in sequences

• Number of simple connected graphs on n unlabeled nodes.at n=11A001349
• Number of 6-indecomposable (connected) graphs on n nodes.at n=11A128528
• Number of unlabeled prime graphs with respect to the Cartesian multiplication of graphs with n vertices.at n=10A129582
• Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.at n=55A201922
• 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=25A217955