Triangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 1.

A101276

Triangle read by rows: T(n,k) is the number of ordered trees having n edges and k branches of length 1.

Terms

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

External references