Is there a way to find the primes of a certain form, such as 2n + 1 or 2^n - 1? and is there a way where you can easily switch between them?

Question

I\'ve been typing away at my keyboard trying to edit my prime finding code so it is not all primes, just some of a certain equation. Here is my C++ code: