cp's OEIS Frontend

A328083 Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and height k (1<=k<=n).

%I A328083 #11 Oct 17 2019 12:20:12
%S A328083 1,1,1,1,3,1,1,6,5,1,1,11,14,7,1,1,19,35,24,9,1,1,32,80,72,36,11,1,1,
%T A328083 53,173,196,123,50,13,1
%N A328083 Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and height k (1<=k<=n).
%H A328083 Rigoberto Flórez, Leandro Junes, José L. Ramírez, <a href="https://doi.org/10.1016/j.disc.2019.06.018">Enumerating several aspects of non-decreasing Dyck paths</a>, Discrete Mathematics, Vol. 342, Issue 11 (2019), 3079-3097. See page 3089.
%e A328083 Triangle begins:
%e A328083 1,
%e A328083 1,1,
%e A328083 1,3,1,
%e A328083 1,6,5,1,
%e A328083 1,11,14,7,1,
%e A328083 1,19,35,24,9,1,
%e A328083 1,32,80,72,36,11,1,
%e A328083 1,53,173,196,123,50,13,1,
%e A328083 ...
%Y A328083 Cf. A121460.
%K A328083 nonn,tabl,more
%O A328083 1,5
%A A328083 _N. J. A. Sloane_, Oct 16 2019