286884

Appears in sequences

• Number of clouds with n points; number of undirected 2-regular labeled graphs; or number of n X n symmetric matrices with (0,1) entries, trace 0 and all row sums 2.at n=10A001205
• Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.at n=47A059441
• Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.at n=52A059441
• Triangle read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges that are node-disjoint unions of undirected cycle subgraphs.at n=65A144161
• Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with unicyclic components having exactly k nodes with degree 1; n>=3, 0<=k<=n-3.at n=28A217763
• Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n).at n=52A324163
• Triangle read by rows: T(n,k) is the number of labeled simple graphs with n edges and k vertices and without endpoints or isolated vertices.at n=54A369931
• Number of 7-regular labeled graphs on 2n nodes.at n=5A374842