Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g.
A185130
Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =2a(5) =15a(6) =5a(7) =1a(8) =71a(9) =21a(10) =2a(11) =428a(12) =103a(13) =8a(14) =1a(15) =3406a(16) =752a(17) =48a(18) =1a(19) =34270a(20) =7385a(21) =450a(22) =5a(23) =418621a(24) =91939a(25) =5752a(26) =32a(27) =5937051a(28) =1345933a(29) =90555
External references
- oeis: A185130