911068

Appears in sequences

• Number of paths from (0,0) to (3n,0) that stay in first quadrant (but may touch horizontal axis), where each step is (2,1),(1,2) or (1,-1) and start with (2,1).at n=7A032349
• Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.at n=43A071949
• Length of list created by n substitutions k -> Range[-abs(k+1), abs(k-1), 2] starting with {0}.at n=14A084078
• Triangle, read by rows, where each column equals the convolution of A032349 with the prior column, starting with column 0 equal to A032349 shift right.at n=36A102230
• 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 returns to the x-axis.at n=29A108435
• A convolution triangle of numbers based on A027307.at n=37A110682
• Number of paths from (0,0) if n is even, or from (2,1) if n is odd, to (3n,0) that stay in first quadrant (but may touch horizontal axis) and where each step is (2,1), (1,2) or (1,-1).at n=15A137842
• Triangle, read by rows, T(n,k)=k/n*Sum_{i=0..n-k} C(2*n,n-k-i)*C(2*n+i-1,i).at n=28A257532