Triangle read by rows: T(n,k) = number of graphs with n edges and k connected components.

Terms

a(0) =1a(1) =1a(2) =1a(3) =3a(4) =1a(5) =1a(6) =5a(7) =4a(8) =1a(9) =1a(10) =12a(11) =8a(12) =4a(13) =1a(14) =1a(15) =30a(16) =23a(17) =9a(18) =4a(19) =1a(20) =1a(21) =79a(22) =57a(23) =26a(24) =9a(25) =4a(26) =1a(27) =1a(28) =227a(29) =160