There are lots of formulas, like $f(n) = n^2 + n + 41$, that generate lots of primes very often. But they're not guaranteed to always generate only prime numbers.
Do there exist any simple/efficient formulas $f(n)$ that are guaranteed to generate a sequence of only prime numbers for each $n$? Or has it been proven that such a formula can't exist?
To be clear, I don't want a trivial formula like $f(n)=7$ (which technically always produces only prime numbers). And it has to be decently simple/efficient, meaning that things like Willans' Formula don't count.