84618

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=37A114848
• Number of peakless Motzkin paths of length n, assuming that the (1,0)-steps come in 2 colors.at n=11A187256
• G.f. A(x) satisfies: x = Product_{n>=1} (1 - x^n*A(x)) * (1 - x^(n-1)/A(x)).at n=10A356499