Triangle of number of connected graphs with n>=2 nodes and maximum degree 1<=k<n.

Terms

a(0) =1a(1) =0a(2) =2a(3) =0a(4) =2a(5) =4a(6) =0a(7) =2a(8) =8a(9) =11a(10) =0a(11) =2a(12) =27a(13) =49a(14) =34a(15) =0a(16) =2a(17) =62a(18) =289a(19) =344a(20) =156a(21) =0a(22) =2a(23) =192a(24) =1735a(25) =4457a(26) =3687a(27) =1044a(28) =0a(29) =2