A328084 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).

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

Offset

1,8

Comments

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

Links

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

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

Example

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

Crossrefs

Cf. A328085.

Sequence in context: A076879 A225230 A367106 * A351357 A263250 A209287

Adjacent sequences: A328081 A328082 A328083 * A328085 A328086 A328087

Keyword

nonn,tabf,more

Author

N. J. A. Sloane, Oct 16 2019

Status

approved