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

Terms

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