97546domain: NAppears in sequencesNumber of trivalent connected simple graphs with 2*n nodes and girth at least 4.at n=10A014371Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth at least g.at n=24A185131a(n) = n*(15*n^2 - 15*n + 4).at n=19A272134