5802920

Appears in sequences

• 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.at n=36A114508
• Number of Dyck paths of semilength n having no ascents of length 4.at n=15A114509