11180820

Appears in sequences

• Number of trivalent (or cubic) labeled graphs with 2n nodes.at n=5A002829
• Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.at n=48A059441
• Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.at n=51A059441
• Triangle read by rows: T(n,k) is the number of connected k-regular simple graphs on n labeled vertices, (0 <= k < n).at n=51A324163
• The number of labeled 6-regular graphs on n nodes.at n=10A339847