3459386

Appears in sequences

• Number of connected regular graphs of degree 8 with n nodes.at n=14A014378
• Number of 5-regular graphs (quintic graphs) on 2n vertices.at n=7A165626
• Number of not necessarily connected 8-regular simple graphs on n vertices.at n=14A180260
• Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth exactly g.at n=5A184980
• Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth at least g.at n=5A184981
• Number of connected 8-regular simple graphs on n vertices with girth exactly 3.at n=14A184983
• Number of connected k-regular graphs on 2*n nodes with maximal diameter D(n,k) A296525 written as array T(n,k), 2 <= k < 2*n.at n=36A296526