I didn't find similar questions so decided to ask this one. Given positive integers $n$ and $d$ how can we efficiently estimate (or better calculate) cardinality of the set $~~ \{ \sigma^d ~~|~~ \sigma \in S_n \} ~~$? Here $S_n$ denotes the set of all permutations on the set $~~\{1, \dots, n\}$. Closed formula, recurrence relation or algorithmic approach are all wellcome.
Unfortunately i have no ideas how to approach this problem so any help will be highly appreciated. Thanks in advance.