111964

Appears in sequences

• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having height of the first peak equal to k.at n=43A108437
• Number of length n+2 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=21A255109