cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A303285 Number of permutations p of [2n] such that the sequence of ascents and descents of p0 forms a Dyck path.

Table of values

n a(n)
0 1
1 1
2 8
3 172
4 7296
5 518324
6 55717312
7 8460090160
8 1726791794432
9 456440969661508
10 151770739970889792
11 62022635037246022000
12 30564038464166725328768
13 17876875858414492985045712
14 12245573879235563308351042496
15 9711714975145772145881269175104

List of values

[1, 1, 8, 172, 7296, 518324, 55717312, 8460090160, 1726791794432, 456440969661508, 151770739970889792, 62022635037246022000, 30564038464166725328768, 17876875858414492985045712, 12245573879235563308351042496, 9711714975145772145881269175104]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.