This sum is not equal to the stationary distribution actually. Rigorously, it should be
$$\sum_{k=0}^\infty \gamma^k \mathrm{Pr}(s_0\rightarrow s,k,\pi)=
\left[(I_n-\gamma P_{\pi})^{-1}\right]_{s_0s}=\mathrm{Pr}_{\pi}(s|s_0)\doteq\rho_\pi(s)$$
which can be called the total discounted state transition probability. Here, $P_\pi$ is the state transition matrix.
Moreover, people usually do not care about whether $\rho_\pi$ is the same as $d_\pi$. That is because $\rho_\pi$ is also a distribution similar to the stationary distribution that describes long-run behaviors of the underlying Markov process given the policy. When we write the gradient in terms of expectation or we use the stochastic policy gradient, the distribution will disappear.
If you are really interested, you can check Chapter~9 of this book Mathematical Foundation of Reinforcement Learning for details. In particular, you can check Theorem 9.2 for details of the above equation. You will also see that if we want to calculate the rigorous policy gradients, we need to be careful about different objective functions and discounted/undiscounted cases.
Hope it is helpful.