Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and cut-connectivity k.

A327125

Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and cut-connectivity k.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =1a(6) =4a(7) =3a(8) =0a(9) =1a(10) =26a(11) =28a(12) =9a(13) =0a(14) =1a(15) =296a(16) =490a(17) =212a(18) =25a(19) =0a(20) =1a(21) =6064a(22) =15336a(23) =9600a(24) =1692a(25) =75a(26) =0a(27) =1a(28) =230896

External references