Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3.
A114506
Triangle read by rows: T(n,k) is number of Dyck paths of semilength n having k ascents of length 3 (0<=k<=floor(n/3)). Also number of ordered trees with n edges that have k vertices of outdegree 3.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =1a(5) =10a(6) =4a(7) =27a(8) =15a(9) =79a(10) =50a(11) =3a(12) =240a(13) =168a(14) =21a(15) =750a(16) =568a(17) =112a(18) =2387a(19) =1959a(20) =504a(21) =12a(22) =7711a(23) =6850a(24) =2115a(25) =120a(26) =25214a(27) =24211a(28) =8536a(29) =825
External references
- oeis: A114506