202755

Appears in sequences

• Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges.at n=55A054548
• Number of connected labeled graphs with n nodes and n+6 edges.at n=6A061544
• 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=54A062734
• 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=33A123527
• 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=39A276639
• 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=34A276640
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=29A321711
• a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/4)} binomial(n-3*k-1,k) * a(k).at n=38A352043