55942352184domain: NAppears in sequencesEulerian version of the Catalan numbers, a(n) = A008292(2*n+1,n+1)/(n+1).at n=7A177042Number of permutations p of [n] such that the sequence of ascents and descents of p or of p0 (if n is even) forms a Dyck path.at n=15A303287