Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth exactly g.
A184980
Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth exactly g.
Terms
- a(0) =1a(1) =1a(2) =6a(3) =94a(4) =10786a(5) =3459386a(6) =1470293676a(7) =733351105934a(8) =1
External references
- oeis: A184980