Irregular triangle C(n,g) read by rows, counting the connected 6-regular simple graphs on n vertices with girth exactly g.
A184960
Irregular triangle C(n,g) read by rows, counting the connected 6-regular simple graphs on n vertices with girth exactly g.
Terms
- a(0) =1a(1) =1a(2) =4a(3) =21a(4) =266a(5) =7848a(6) =1a(7) =367860a(8) =0a(9) =21609299a(10) =1a(11) =1470293674a(12) =1a(13) =113314233799a(14) =9a(16) =6
External references
- oeis: A184960