I saw this in Wegener(2003), Methods for the Analysis of Evolutionary Algorithms as a upper bound on the probability.
After applying Stirling approximation to $(\frac{n}{3})!$ I still keep getting something like $O(n^{-n+ \epsilon})$. The paper does not offer any additional derivation details, so I wonder if some1 could help me out with this.