Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth at least g.
A185330
Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth at least g.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =6a(4) =2a(5) =21a(6) =6a(7) =1a(8) =94a(9) =23a(10) =2a(11) =540a(12) =112a(13) =9a(14) =1a(15) =4207a(16) =801a(17) =49a(18) =1a(19) =42110a(20) =7840a(21) =455a(22) =5a(23) =516344a(24) =97723a(25) =5784a(26) =32a(27) =7373924a(28) =1436873a(29) =90940
External references
- oeis: A185330