Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of odd length (n>=0, 0<=k<=n).
A102003
Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of odd length (n>=0, 0<=k<=n).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =1a(6) =0a(7) =3a(8) =0a(9) =2a(10) =2a(11) =0a(12) =8a(13) =0a(14) =4a(15) =0a(16) =11a(17) =0a(18) =22a(19) =0a(20) =9a(21) =5a(22) =0a(23) =45a(24) =0a(25) =61a(26) =0a(27) =21a(28) =0a(29) =41
External references
- oeis: A102003