Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth at least g.
A185131
Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth at least g.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =5a(4) =2a(5) =19a(6) =6a(7) =1a(8) =85a(9) =22a(10) =2a(11) =509a(12) =110a(13) =9a(14) =1a(15) =4060a(16) =792a(17) =49a(18) =1a(19) =41301a(20) =7805a(21) =455a(22) =5a(23) =510489a(24) =97546a(25) =5783a(26) =32a(27) =7319447a(28) =1435720a(29) =90938
External references
- oeis: A185131