1431816856

Appears in sequences

• Number of ascents of length 1 in all dispersed Dyck paths of length n (i.e., in all Motzkin paths of length n with no (1,0) steps at positive heights). An ascent is a maximal sequence of consecutive (1,1)-steps.at n=31A191386
• a(n) = 2^(n - 1) + binomial(n, floor(n/2))*(n + 1)/2.at n=29A323988