Triangle read by rows: T(n,k) is the number of graphs with n vertices with edge connectivity k.

Terms

a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =5a(7) =3a(8) =2a(9) =1a(10) =13a(11) =10a(12) =8a(13) =2a(14) =1a(15) =44a(16) =52a(17) =41a(18) =15a(19) =3a(20) =1a(21) =191a(22) =351a(23) =352a(24) =121a(25) =25a(26) =3a(27) =1a(28) =1229a(29) =3714