66462606

Appears in sequences

• Number of 4-valent labeled graphs with n nodes.at n=10A005815
• 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=49A059441
• 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=50A059441
• 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=50A324163
• Number of labeled 5-regular graphs on 2n nodes.at n=5A338978
• Number of n-regular graphs on 2*n labeled nodes.at n=5A361254