1513512

Appears in sequences

• Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.at n=30A069466
• Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.at n=33A069466
• Duplicate of A069466.at n=30A141902
• Duplicate of A069466.at n=33A141902
• Number T(n,k) of partitions of an n-set with distinct block sizes and maximal block size equal to k; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns.at n=34A262078
• Square array read by ascending antidiagonals: T(n,k) = F(n) * (4*k)!/(k!*(k + n + 1)!^3), where F(n) = (1/8)*(4*n + 4)!/(n + 1)!; n, k >= 0.at n=11A361032
• Square array read by ascending antidiagonals: T(n,k) = F(n) * (4*k)!/(k!*(k + n + 1)!^3), where F(n) = (1/8)*(4*n + 4)!/(n + 1)!; n, k >= 0.at n=14A361032
• a(n) = 3*(4*n)!/(n!*(n+1)!^3).at n=4A361033