67014

Appears in sequences

• Number of simple unlabeled n-node graphs of connectivity 1.at n=8A052442
• Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1).at n=37A259862
• a(0)=1; thereafter a(n) = 2*A110501(n+1) - A005439(n).at n=6A362112