277799

Appears in sequences

• 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.at n=35A114506
• Number of Dyck paths of semilength n having no ascents of length 3.at n=13A114507