Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of length 1 starting from the root (0<=k<=n).

A127158

Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of length 1 starting from the root (0<=k<=n).

Terms

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

External references