Triangle of number of connected graphs with k >= 1 edges and n nodes (2 <= n <= k+1).

Terms

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