How the hardness of hidden subgroup problem in $S_n$ changes as the order of the subgroup grows?
At worst you have to check one element of each repeated prime cycle, https://oeis.org/A186202 Smaller than n! but still large.