281844

Appears in sequences

• Triangle read by rows T(n,k) = the number of Dyck paths of semilength n with k UUDDU's, 0<=k<=[(n-1)/2].at n=43A114848
• Number of peakless Motzkin paths of length n, assuming that the (1,0)-steps come in 2 colors.at n=12A187256