34763300

Appears in sequences

• a(n) = (2*n)!*(2*n+1)! / (n! * (n+1)!)^2.at n=8A000891
• a(n) is the number of n-step walks on square lattice such that 0 <= y <= x at each step.at n=16A005558
• Triangle read by rows: T(n, k) = binomial(2*n+1, n-k)^2*(2*k+1)/(2*n+1).at n=36A067802
• Square array T(n,k) read by antidiagonals: number of tilings of an <n,k,n> hexagon.at n=47A103905
• a(n) = binomial(n+4,n)*binomial(n+9,n).at n=9A104672
• Ninth column (and diagonal) of Narayana triangle A001263.at n=8A134290
• Moment sequence of tr(A^2) in USp(4).at n=16A138350
• Number of 8 X 8 matrices with elements in 0..n with each row and each column in nondecreasing order. 8,8,n can be permuted, see formula.at n=2A140917
• Triangle T(n, k) = binomial(2*n, 2*k)*binomial(2*n+1, 2*k+1)/(2*n-2*k+1), read by rows.at n=40A155516
• 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=54A378062