A328083 Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and height k (1<=k<=n).
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, 53, 173, 196, 123, 50, 13, 1
Offset: 1
Examples
Triangle begins: 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,53,173,196,123,50,13,1, ...
Links
- Rigoberto Flórez, Leandro Junes, José L. Ramírez, Enumerating several aspects of non-decreasing Dyck paths, Discrete Mathematics, Vol. 342, Issue 11 (2019), 3079-3097. See page 3089.
Crossrefs
Cf. A121460.