261080

Appears in sequences

• Number of simple connected graphs on n unlabeled nodes.at n=9A001349
• Number of connected 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.at n=8A076328
• a(n) = n*(n+1)*(2*n^3 - n^2 + 2)/6.at n=15A101383
• Number of 5-indecomposable (connected) graphs on n nodes.at n=9A128527
• Number of 6-indecomposable (connected) graphs on n nodes.at n=9A128528
• Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.at n=36A201922
• 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=17A217955
• 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=44A224065
• 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=53A224065
• Number of primes generated from Euler's polynomial x^2 + x + 41 from x = 1 to 10^n.at n=6A228123
• Regular triangle where T(n,k) is the number of unlabeled k-uniform connected hypergraphs spanning n vertices.at n=37A301924
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with vertex-connectivity >= k.at n=46A327365
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs with n vertices and vertex-connectivity >= k.at n=46A327805