Triangular array read by rows. T(n,k) is the number of simple unlabeled graphs with n vertices whose components belong to exactly k distinct isomorphism classes.

A331123

Triangular array read by rows. T(n,k) is the number of simple unlabeled graphs with n vertices whose components belong to exactly k distinct isomorphism classes.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =1a(4) =8a(5) =3a(6) =22a(7) =12a(8) =116a(9) =38a(10) =2a(11) =854a(12) =181a(13) =9a(14) =11125a(15) =1176a(16) =45a(17) =261083a(18) =13351a(19) =233a(20) =1a(21) =11716594a(22) =287048a(23) =1513a(24) =13a(25) =1006700566a(26) =12281514a(27) =15707a(28) =77a(29) =164059830598

External references