An effective analytic recurrence for prime numbers: from asymptotics to explicit bounds

We present an explicit and effective recurrence formula for prime numbers, bridging arithmetic and analytic approaches. Building upon foundational work by Gandhi (1971), Golomb (1976), and Keller (2007), we establish the effective bound $s_n \le 2p_n$ for all $n \ge 1$ within the Golomb-Keller analytic recurrence. This transforms their asymptotic formula into an explicit recurrence using twice the n-th prime as the exponent: $$ p_{n+1} = \left\lceil \left( -1 + ζ(2p_n) \prod_{j=1}^{n} \left(1 - \frac{1}{p_j^{2p_n}}\right) \right)^{-1/(2p_n)} \right\rceil $$ The proof is self-contained and relies on Bertrand's postulate. We also present strong numerical and heuristic evidence for a sharper conjecture: $s_n \le p_n$ for all $n \ge 1$, suggesting that the formula works with the n-th prime as the exponent.