80890

Appears in sequences

• Number of 3-connected graphs with n nodes.at n=5A006290
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with vertex-connectivity >= k.at n=48A327365
• Triangle read by rows where T(n,k) is the number of unlabeled simple graphs with n vertices and vertex-connectivity >= k.at n=48A327805