41301

Appears in sequences

• Number of unlabeled trivalent (or cubic) connected simple graphs with 2n nodes.at n=9A002851
• 4-dimensional analog of centered polygonal numbers: a(n) = n(n+1)*(n^2+n+4)/12.at n=26A006007
• a(n) = n*(n+1)*(14*n-11)/6.at n=26A172076
• Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth at least g.at n=19A185131
• a(n) = n*(5*n^2-8*n+5)/2.at n=26A226449
• Number of partitions of 3n into exactly 5 parts.at n=34A256314
• Triangle read by rows: Number of unlabeled cubic graphs with 2n nodes and k components.at n=36A275744