Irregular triangle C(n,g) counting the connected 9-regular simple graphs on 2n vertices with girth at least g.
A184991
Irregular triangle C(n,g) counting the connected 9-regular simple graphs on 2n vertices with girth at least g.
Terms
- a(0) =1a(1) =9a(2) =88193a(3) =113314233813
External references
- oeis: A184991