117940535

Appears in sequences

• Number of unlabeled trivalent (or cubic) connected simple graphs with 2n nodes.at n=12A002851
• Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth at least g.at n=31A185131
• Triangle read by rows: Number of unlabeled cubic graphs with 2n nodes and k components.at n=66A275744