367860

Appears in sequences

• Number of connected regular graphs of degree 6 (or sextic graphs) with n nodes.at n=13A006822
• Triangle read by rows: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n.at n=84A051031
• Triangular array C(n, r) = number of connected r-regular graphs with n nodes, 0 <= r < n.at n=84A068934
• Number of 6-regular graphs (sextic graphs) on n vertices.at n=13A165627
• Irregular triangle C(n,g) read by rows, counting the connected 6-regular simple graphs on n vertices with girth exactly g.at n=7A184960
• 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=7A184961
• Number of connected 6-regular simple graphs on n vertices with girth exactly 3.at n=13A184963
• Number of not necessarily connected 6-regular simple graphs on n vertices with girth exactly 3.at n=13A185163
• Triangular array E(n,k) counting, not necessarily connected, k-regular simple graphs on n vertices with girth exactly 3.at n=84A185643
• Triangular array C(n,r) = number of connected r-regular graphs, having girth exactly 3, with n nodes, for 0 <= r < n.at n=84A186733
• Number of connected (2*k)-regular graphs on 2*n+1 nodes with maximal diameter D(n,k) A294733 written as triangular array T(n,k), 1 <= k <= n.at n=17A296524