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.

A259885 a(n) = max{T(n,k), k=1..n}, where T(n,k) is the number of Dyck paths of length 2n and height k (1<=k<=n).

Table of values

n a(n)
1 1
2 1
3 3
4 7
5 18
6 57
7 169
8 484
9 1684
10 5661
11 18579
12 59917
13 214058
14 760487
15 2665884
16 9246276
17 31945379
18 117939506
19 431530926
20 1567159901
21 5655480303
22 20299352107
23 74300429926
24 278279597781
25 1037075511926
26 3848154018734
27 14224439297732
28 52402156308977

List of values

[1, 1, 3, 7, 18, 57, 169, 484, 1684, 5661, 18579, 59917, 214058, 760487, 2665884, 9246276, 31945379, 117939506, 431530926, 1567159901, 5655480303, 20299352107, 74300429926, 278279597781, 1037075511926, 3848154018734, 14224439297732, 52402156308977]