312066

Appears in sequences

• Number of paths from (0,0) 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=7A027307
• Number of n-dimensional partitions of 6.at n=26A042984
• Triangle read by rows of numbers of paths in a lattice satisfying certain conditions.at n=35A071949
• Length of list created by n substitutions k -> Range[-abs(k+1), abs(k-1), 2] starting with {0}.at n=13A084078
• A convolution triangle of numbers based on A027307.at n=28A110682
• 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=14A137842
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(n,j) * binomial(k*n+j+1,n)/(k*n+j+1).at n=52A336534
• Number of solid partitions of n with 7 parts.at n=20A389774