Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth exactly g.

A198303

Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth exactly g.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =3a(4) =2a(5) =13a(6) =5a(7) =1a(8) =63a(9) =20a(10) =2a(11) =399a(12) =101a(13) =8a(14) =1a(15) =3268a(16) =743a(17) =48a(18) =1a(19) =33496a(20) =7350a(21) =450a(22) =5a(23) =412943a(24) =91763a(25) =5751a(26) =32a(27) =5883727a(28) =1344782a(29) =90553

External references