224224

Appears in sequences

• Number triangle T(n,k) = binomial(n,k)*binomial(2n,n-k).at n=38A110608
• Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n, having k ascents of length at least 2 (1 <= k <= floor(n/2), n >= 2).at n=46A114593
• Number of reduced words of length n in the Weyl group D_8.at n=23A162211
• Number of reduced words of length n in the Weyl group D_8.at n=33A162211