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).
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).
Terms
- a(0) =1a(1) =1a(2) =3a(3) =7a(4) =18a(5) =57a(6) =169a(7) =484a(8) =1684a(9) =5661a(10) =18579a(11) =59917a(12) =214058a(13) =760487a(14) =2665884a(15) =9246276a(16) =31945379a(17) =117939506a(18) =431530926a(19) =1567159901a(20) =5655480303a(21) =20299352107a(22) =74300429926a(23) =278279597781
External references
- oeis: A259885