Irregular triangle C(n,g) counting the connected 5-regular simple graphs on 2n vertices with girth exactly g.
A184950
Irregular triangle C(n,g) counting the connected 5-regular simple graphs on 2n vertices with girth exactly g.
Terms
- a(0) =1a(1) =3a(2) =59a(3) =1a(4) =7847a(5) =1a(6) =3459376a(7) =7a(8) =2585136287a(9) =388a(11) =406824
External references
- oeis: A184950