42561
domain: N
Appears in sequences
- Number of permutations of length n with equal cycles.at n=8A005225
- a(n) = n!*Sum_{d|n} (-1)^(d+1)/(d!*(n/d)^d).at n=8A132960
- a(n) = 6^n - 4^n + 1.at n=6A155627
- Triangular array read by rows: T(n,k) is the number of n-permutations that have exactly k distinct cycle lengths.at n=17A218868
- Number T(n,k) of permutations of [n] for which the difference between the longest and the shortest cycle length is k; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows.at n=30A364967