258125

Appears in sequences

• Number of connected labeled graphs with n nodes and n+2 edges.at n=6A061541
• 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=50A062734
• 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=29A123527
• Numbers k such that k and k^2 use only the digits 1, 2, 5, 6 and 8.at n=38A137005
• Triangle read by rows: T(n,k) is the number of labeled connected planar graphs on n vertices and k edges.at n=25A288265
• 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=51A343088