343909

Appears in sequences

• Number T(n,k) of entries in the k-th cycles of all permutations of [n] when cycles are ordered by decreasing lengths (and increasing smallest elements); triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=49A322384
• Number of entries in the fifth cycles of all permutations of [n] when cycles are ordered by decreasing lengths.at n=5A332854
• Number of entries in the n-th cycles of all permutations of [2n] when cycles are ordered by decreasing lengths.at n=4A332928