308152

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=36A114506
• Number of n X 5 0..4 arrays with each element equal to the number its horizontal and vertical neighbors equal to 2.at n=16A197058