274668

Appears in sequences

• Number of simple graphs on n unlabeled nodes.at n=9A000088
• Table T(n,k) giving number of k-multigraphs on n nodes (n >= 1, k >= 0) read by antidiagonals.at n=53A063841
• Number of 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.at n=8A076321
• Number of graphs with n vertices that have an even determinant for the adjacency matrix.at n=8A140981
• Triangle read by rows: T(n,k) is the number of unlabeled simple graphs on n vertices with domination number k.at n=45A263284
• Triangle read by rows: T(n,k) is the number of unlabeled simple graphs with n vertices and maximum vertex degree k, (0 <= k < n).at n=54A263293
• Triangle read by rows: T(n,k) is the number of graphs with n vertices with connected domination number k.at n=30A286958
• Triangle read by rows: T(n,k) = number of graphs on n nodes with domatic number k (n >= 1, 1 <= k <= n).at n=45A294206
• Triangle read by rows: T(n,k) is the number of graphs with n vertices and minimum vertex degree k, (0 <= k < n).at n=45A294217
• Number A(n,k) of k-uniform hypergraphs on n unlabeled nodes; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=75A309858
• Number of 7-uniform hypergraphs on n unlabeled nodes.at n=9A309861
• Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with radius k, (0 <= k <= floor(n/2)).at n=30A324239
• Array read by descending antidiagonals: A(n,k) is the number of unoriented colorings of the edges of a regular n-dimensional simplex using up to k colors.at n=43A327084
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs with n vertices and vertex-connectivity >= k.at n=45A327805
• Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with domination number k, n >= 1, 1 <= k <= A065033(n+1).at n=21A332401
• Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with independent domination number k.at n=45A332402
• Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with irredundance number k.at n=45A332404
• Triangle of number of connected graphs with n>=2 nodes and maximum degree 1<=k<n.at n=44A332760