290745

Appears in sequences

• Central factorial numbers: A008955(n,2).at n=11A000596
• Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges.at n=54A054548
• Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2).at n=53A062734
• Number of connected labeled graphs with n nodes and n+5 edges.at n=6A096117
• Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, n-1 <= k <= n(n-1)/2).at n=32A123527
• Triangle T(m, n) = the number of point-labeled graphs with n points and m edges, no points isolated. By rows, n >= 0, ceiling(n/2) <= m <= binomial(n,2).at n=38A276639
• Triangle T(n, k) = the number of point-labeled graphs with n points and k edges, no points isolated, no edges isolated. By rows, 0 <= n, ceiling(2*n/3) <= k <= binomial(n, 2).at n=33A276640