Triangle read by rows where T(n,k) is the number of unlabeled simple graphs with n vertices and vertex-connectivity >= k.

A327805

Triangle read by rows where T(n,k) is the number of unlabeled simple graphs with n vertices and vertex-connectivity >= k.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =2a(4) =1a(5) =0a(6) =4a(7) =2a(8) =1a(9) =0a(10) =11a(11) =6a(12) =3a(13) =1a(14) =0a(15) =34a(16) =21a(17) =10a(18) =3a(19) =1a(20) =0a(21) =156a(22) =112a(23) =56a(24) =17a(25) =4a(26) =1a(27) =0a(28) =1044a(29) =853

External references