Does this polynomial produce only prime numbers?

[AdrianZ]

I'm trying to find a general formula for an algebraic equation, I'm studying the behavior of ∏_{i=2}^n(1-\frac{1}{i^m}) for m=3 and so far I've seen that I can find a general formula if n^2 + n + 1 produces only prime numbers. if not, it would get way harder to find a general formula for it by my intuitive method. Does anyone have any ideas? Do you know a counter-example? I've tried n=1,2,3,4,5,6 and it seems fine. I think a counter-example wouldn't be so easy to find. anyone can help?
For the experts on this forum who are into number theory, is there a polynomial of any degree that produces only prime numbers?

 

[micromass]

It doesn't work for 7:

7^2+7+1=57=3\cdot 19

I don't think a polynomial exists which only generates primes.

 

[micromass]

See http://mathworld.wolfram.com/Prime-GeneratingPolynomial.html

In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime for all integer values (Nagell 1951, p. 65; Hardy and Wright 1979, pp. 18 and 22)