104829

Appears in sequences

• Directed genus of the binary de Bruijn graph D_n.at n=18A151998
• Number of simple unlabeled n-node graphs of edge-connectivity 5.at n=9A241704
• Triangle read by rows: T(n,k) is the number of unlabeled simple graphs with n vertices and maximum vertex degree k, (0 <= k < n).at n=49A263293
• Triangle read by rows: T(n,k) is the number of graphs with n vertices with edge connectivity k.at n=50A263296
• Triangle read by rows: T(n,k) is the number of graphs with n vertices and minimum vertex degree k, (0 <= k < n).at n=50A294217
• a(n) is the number of positive integer solutions of n*x*y*z*v*w = (x + n) * (y + n) * (z + n) * (v + n) * (w + n), x <= y <= z <= v <= w.at n=33A381644