Number of signed trees with n nodes and p positive edges. Triangle T(n,p) read by rows, 0<=p<n.

Terms

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