1225785

Appears in sequences

• Number of permutations of [n+1] with exactly 1 increasing subsequence of length 3.at n=10A003517
• a(n) = binomial(n+7, 7)*(n+4)/4.at n=16A053347
• Ninth column (m=8) of (1,3)-Pascal triangle A095660.at n=16A095664
• Row maximum of Catalan triangle with zeros (A053121), i.e., maximum value of (m+1)*binomial(n+1,(n-m)/2)/(n+1) for given n with m same parity as n.at n=25A101461
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross downwards the x-axis k times. (A Grand Dyck path of semilength n is a path in the half-plane x>=0, starting at (0,0), ending at (2n,0) and consisting of steps u=(1,1) and d=(1,-1)).at n=43A118919
• Number of ballot sequences of length n having 10 largest parts.at n=15A244107
• Arises from enumeration of a certain class of partial zig-zag knight's paths on the square grid.at n=24A368379
• a(n) = product of those prime(k) such that floor(n/prime(k)) is even.at n=49A372007