21609300

Appears in sequences

• Number of connected regular graphs of degree 6 (or sextic graphs) with n nodes.at n=14A006822
• Irregular triangle C(n,g) read by rows, counting the connected 6-regular simple graphs on n vertices with girth at least g.at n=9A184961
• Irregular triangle C(n,g) counting the connected 7-regular simple graphs on 2n vertices with girth exactly g.at n=3A184970
• Number of connected 7-regular simple graphs on 2n vertices with girth exactly 3.at n=7A184973
• Number of not necessarily connected 6-regular simple graphs on n vertices with girth exactly 3.at n=14A185163