Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k ascents of length 4 (0<=k<=floor(n/4)). Also number of ordered trees with n edges which have k vertices of outdegree 4.
A114508
Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and having k ascents of length 4 (0<=k<=floor(n/4)). Also number of ordered trees with n edges which have k vertices of outdegree 4.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =5a(4) =13a(5) =1a(6) =37a(7) =5a(8) =111a(9) =21a(10) =345a(11) =84a(12) =1104a(13) =322a(14) =4a(15) =3611a(16) =1215a(17) =36a(18) =12016a(19) =4555a(20) =225a(21) =40548a(22) =17028a(23) =1210a(24) =138414a(25) =63636a(26) =5940a(27) =22a(28) =477076a(29) =238004
External references
- oeis: A114508