1456875

Appears in sequences

• Number of n-node labeled graphs whose components are unicyclic graphs.at n=8A137916
• Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph has at most one cycle.at n=44A144228
• Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge.at n=36A368924