193900

Appears in sequences

• Number of connected 4-regular simple graphs on n vertices with girth at least 4.at n=17A033886
• Irregular triangle C(n,g) counting the connected 4-regular simple graphs on n vertices with girth exactly g.at n=22A184940
• Irregular triangle C(n,g) counting the connected 4-regular simple graphs on n vertices with girth at least g.at n=22A184941
• Number of connected 4-regular simple graphs on n vertices with girth exactly 4.at n=17A184944
• Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth exactly g.at n=22A185140
• Number of not necessarily connected 4-regular simple graphs on n vertices with girth exactly 4.at n=17A185144
• Triangular array E(n,k) counting not necessarily connected k-regular simple graphs on n vertices with girth at least 4.at n=84A185304
• Irregular triangle E(n,g) counting not necessarily connected 4-regular simple graphs on n vertices with girth at least g.at n=22A185340
• Number of not necessarily connected 4-regular simple graphs on n vertices with girth at least 4.at n=17A185344
• Triangular array E(n,k) counting, not necessarily connected, k-regular simple graphs on n vertices with girth exactly 4.at n=84A185644
• Triangular array C(n, k) = number of connected k-regular graphs, having girth at least 4, with n nodes, 0 <= k <= n div 2.at n=84A186714
• Triangular array C(n,k) counting connected k-regular simple graphs on n vertices with girth exactly 4.at n=84A186734