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.

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

Table of values

n a(n)
0 1
1 4
2 60
3 1974
4 114972
5 10490392
6 1384890104
7 250150900354
8 59317740001132
9 17886770092245360
10 6687689652133397064
11 3037468107154650475868
12 1647659575564603380270360
13 1052309674407466474533397824
14 781725844087366504901991503920
15 668408235613132734111402947167658

List of values

[1, 4, 60, 1974, 114972, 10490392, 1384890104, 250150900354, 59317740001132, 17886770092245360, 6687689652133397064, 3037468107154650475868, 1647659575564603380270360, 1052309674407466474533397824, 781725844087366504901991503920, 668408235613132734111402947167658]

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

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