132484

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 have k triple descents (i.e., ddd's).at n=51A108443
• G.f.: Sum_{k>=0} (1 + k*x)^k * x^(2*k).at n=18A360699