Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k cycles that are not up-down. A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1)<b(2)>b(3)<... .

A186361

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k cycles that are not up-down. A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1)<b(2)>b(3)<... .