Number 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.
A303287
Number 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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =8a(5) =22a(6) =172a(7) =604a(8) =7296a(9) =31238a(10) =518324a(11) =2620708a(12) =55717312a(13) =325024572a(14) =8460090160a(15) =55942352184
External references
- oeis: A303287