Number of unlabeled graphs on n nodes that have exactly two non-isomorphic components.

A216785

Number of unlabeled graphs on n nodes that have exactly two non-isomorphic components.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =2a(4) =8a(5) =28a(6) =145a(7) =1022a(8) =12320a(9) =274785a(10) =12007355a(11) =1019030127a(12) =165091859656

External references