262322

Appears in sequences

• Number of n-node graphs without isolated nodes.at n=9A002494
• Triangular array read by rows: T(n,k) is the number of unlabeled simple graphs with n nodes that have exactly k isolated nodes, (n>=0, 0<=k<=n).at n=45A217653
• Triangular array read by rows: T(n,k) is the number of unlabeled simple graphs with n nodes that have exactly k isolated nodes, (n>=0, 0<=k<=n).at n=56A217653
• Regular triangle where T(n,k) is the number of unlabeled k-uniform hypergraphs spanning n vertices.at n=37A301922
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with vertex-connectivity >= k.at n=45A327365