Triangle read by rows: T(n,k) = number of permutations of (1, 2, ..., n) with longest monotonic subsequence of length k (1<=k<=n).

A366503

Triangle read by rows: T(n,k) = number of permutations of (1, 2, ..., n) with longest monotonic subsequence of length k (1<=k<=n).