382239

Appears in sequences

• Number of walks on square lattice. Column y=2 of A052174.at n=10A005560
• Triangle read by rows: T(n, k) = binomial(2*n+1, n-k)^2*(2*k+1)/(2*n+1).at n=22A067802
• a(n) is the number of walks from (0,0) to (0,2) that remain in the upper half-plane y >= 0 using 2*n unit steps either up (U), down (D), left (L) or right (R).at n=5A145601
• Array read by ascending antidiagonals: A(n, k) = (n + 1)*binomial(2*k + n - 1, k - 1)^2 / (2*k + n - 1) for k > 0, and A(n, 0) = 0.at n=42A378062