156555

Appears in sequences

• Number of connected labeled graphs with n nodes and n+1 edges.at n=6A061540
• 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=49A062734
• 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=28A123527
• Triangle read by rows: T(n,k) is the number of labeled connected planar graphs on n vertices and k edges.at n=24A288265
• Triangle read by rows: T(n,k) is the number of connected labeled graphs with n edges and k vertices, 1 <= k <= n+1.at n=42A343088