A328084 - OEIS

%I #10 Oct 17 2019 12:20:26

%S 1,0,1,1,0,0,1,2,1,1,0,0,0,1,3,2,3,2,1,1,0,0,0,0,1,4,3,5,5,5,4

%N Irregular triangle read by rows: T(n,k) is the number of Dyck paths in the family D^{h,>}_n with maximal height equal to k (k>=1, n>=1).

%C See Florez et al. (2019) for precise definition.

%H 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 3093.

%e 1,

%e 0,1,1,

%e 0,0,1,2,1,1,

%e 0,0,0,1,3,2,3,2,1,1,

%e 0,0,0,0,1,4,3,5,5,5,4,...,

%e ...

%Y Cf. A328085.

%K nonn,tabf,more

%O 1,8

%A _N. J. A. Sloane_, Oct 16 2019