4483360

Appears in sequences

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