Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of even length (n>=0, 0<=k<=floor(n/2)).
A102004
Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of even length (n>=0, 0<=k<=floor(n/2)).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =2a(6) =6a(7) =7a(8) =1a(9) =16a(10) =20a(11) =6a(12) =40a(13) =64a(14) =26a(15) =2a(16) =109a(17) =196a(18) =108a(19) =16a(20) =297a(21) =619a(22) =414a(23) =96a(24) =4a(25) =836a(26) =1940a(27) =1557a(28) =484a(29) =45
External references
- oeis: A102004