Triangle read by rows: number of connected graphs with k >= 0 edges and n nodes (1<=n<=k+1).

Terms

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