68120

Appears in sequences

• Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis (i.e., d or u steps hitting the x-axis).at n=52A109193
• a(n) = 4*(3*n+1)*(3*n+2).at n=43A144410
• Number of length n+3 0..3 arrays with at most one downstep in every 3 consecutive neighbor pairs.at n=5A258725
• T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs.at n=33A258730
• Number of length n+6 0..3 arrays with at most one downstep in every n consecutive neighbor pairs.at n=2A258736
• Number of (n+1) X (1+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101.at n=14A259215