Irregular triangle C(n,g) counting the connected 5-regular simple graphs on 2n vertices with girth at least g.

A184951

Irregular triangle C(n,g) counting the connected 5-regular simple graphs on 2n vertices with girth at least g.

Terms

    a(0) =1a(1) =3a(2) =60a(3) =1a(4) =7848a(5) =1a(6) =3459383a(7) =7a(8) =2585136675a(9) =388a(11) =406824

External references