The number of unlabelled simple graphs with n nodes such that no two connected components are identical.

A207828

The number of unlabelled simple graphs with n nodes such that no two connected components are identical.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =3a(4) =8a(5) =29a(6) =142a(7) =1005a(8) =12173a(9) =273582a(10) =11992634a(11) =1018722089a(12) =165079154766

External references