332768

Appears in sequences

• Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x).at n=49A110107
• Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals four.at n=14A288543