The error in the approximation for $\log(n!)$ by $n\log(n) - n$ is $O(\log(n))$. Doesn't this imply that as $n$ increases, the error increases, but very, very slowly (similar to $\log(n)$)? But doesn't this approximation improve as $n$ gets larger (in other words, the error should be decreasing!). It would also suggest that the error is lower for smaller $n$ since $\log(n)$ is monotonically increasing?
I am certainly making some conceptual errors in coming to this conclusion, can you correct them?
Technically a $O(log(n))$ is not something that has to increase with a speed comparable to $log(n)$, it is rather something that cannot increase faster than some fixed constant times $log(n)$.
Secondly, even if in this case the error does increase, the point is that relatively to your main terms $nlog(n)−n$, an error of $log(n)$ is small.
If you are trying to find approximately the age of the universe, an error of $10,000$ years is small.