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.

A355503 Total number of m-tuples (p_1, p_2, ..., p_m) of Dyck paths of semilength n-m, such that each p_i is never below p_{i-1} for m=0..n.

Table of values

n a(n)
0 1
1 2
2 3
3 5
4 11
5 35
6 164
7 1120
8 10969
9 152849
10 3029650
11 85227078
12 3400752392
13 192644205130
14 15470939367651
15 1761760468965521
16 284641456742538865
17 65175288287611738435
18 21159611204475209730138
19 9743708333490185603430830
20 6357930817596444858142966826

List of values

[1, 2, 3, 5, 11, 35, 164, 1120, 10969, 152849, 3029650, 85227078, 3400752392, 192644205130, 15470939367651, 1761760468965521, 284641456742538865, 65175288287611738435, 21159611204475209730138, 9743708333490185603430830, 6357930817596444858142966826]