1116277

Properties

Appears in sequences

• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .at n=56A186754
• Number of permutations of [n] having exactly one increasing cycle.at n=10A349788
• Prime numbersat n=86909