|
|
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).
|
|
4
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n=4, a(4)=7 because T(4,1)=1, T(4,2)=7, T(4,3)=5, T(4,4)=1.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|