Triangle read by rows: T(n,k) is the number of k-trees with n unlabeled nodes rooted at a hedron.

Terms

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