Number of unlabeled graphs with n nodes that have two components, neither of which is the empty graph.

A274934

Number of unlabeled graphs with n nodes that have two components, neither of which is the empty graph.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =1a(4) =3a(5) =8a(6) =30a(7) =145a(8) =1028a(9) =12320a(10) =274806a(11) =12007355a(12) =1019030239a(13) =165091859656

External references