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

A327069

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

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =4a(7) =3a(8) =1a(9) =0a(10) =26a(11) =28a(12) =9a(13) =1a(14) =0a(15) =296a(16) =475a(17) =227a(18) =25a(19) =1a(20) =0a(21) =6064a(22) =14736a(23) =10110a(24) =1782a(25) =75a(26) =1a(27) =0

External references