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,5

Links

Table of n, a(n) for n=1..36.

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.

Example

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,
...

Crossrefs

Cf. A121460.

Sequence in context: A055898 A145904 A273350 * A370174 A278132 A203950

Adjacent sequences: A328080 A328081 A328082 * A328084 A328085 A328086

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Oct 16 2019

Status

approved