90938

Appears in sequences

• Number of trivalent connected simple graphs with 2n nodes and girth at least 5.at n=11A014372
• Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth at least g.at n=29A185131
• Irregular triangle C(n,k)=number of connected k-regular graphs on n vertices having girth at least five.at n=76A186715