%I #10 Sep 19 2018 05:44:34

%S 1,4,1,13,5,1,39,19,6,1,112,64,26,7,1,313,201,97,34,8,1,859,603,331,

%T 139,43,9,1,2328,1752,1064,512,191,53,10,1

%N Triangle read by rows: T(n,k) (n>=2, 0 <= k <= n-2) = number of Dyck paths with k valleys of altitude k.

%H Czabarka, É., Flórez, R., Junes, L., & Ramírez, J. L., <a href="https://doi.org/10.1016/j.disc.2018.06.032">Enumerations of peaks and valleys on non-decreasing Dyck paths</a>, Discrete Mathematics (2018), 341(10), 2789-2807.

%e Triangle begins:

%e 1,

%e 4,1,

%e 13,5,1,

%e 39,19,6,1,

%e 112,64,26,7,1,

%e 313,201,97,34,8,1,

%e 859,603,331,139,43,9,1,

%e 2328,1752,1064,512,191,53,10,1,

%e ...

%Y Columns 0, 1, 2. 3 are A105693, A318946, A318947, A319405.

%K nonn,tabl,more

%O 2,2

%A _N. J. A. Sloane_, Sep 18 2018