Certainly. has the form , correct? So what you're really asking for is the set of integers of the form

which are such that primes , . This is not a high school level problem, particularly for U.S. students, but it is not beyond approach. Let me put it this way for you, which should lead you to the answer:

What you're trying to avoid is that there is a prime such that [ ], [ ], , [ ] where [ ]. So try looking at a few cases that solve the system of equations you're looking for them to solve and make a couple of hypotheses (although it should be moderately apparent, and if not, the OEIS is always a good tool, if it wouldn't feel too much like cheating. But don't only look at primes for values of or you will not find the sequence!). You will find that there is a certain class of numbers that admits the property which you seek, and a proof by contradiction follows without too much trouble. It is a much easier problem algebraically than when using strictly elementary tools, but I see how to go about it using only elementary techniques. Another hint: Ignore the '1' and try to avoid [ ].

The proof is not short, but I will come back in a week or two and write it out for you if you still have not come up with the solution.