Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Feb 12 2023 11:07:53
%S 1,7,25,31,34,271,514,2896,8827,16816,37933
%N Numbers n such that (2^n+1)^4-2 is prime.
%C Some of the results were computed using the PrimeFormGW (PFGW) primality-testing program. - _Hugo Pfoertner_, Nov 14 2019
%C a(12) > 60000. - _Tyler Busby_, Feb 12 2023
%e a(1) = 1 because (2^1+1)^4 - 2 = 79 is prime and is the first such prime.
%t Select[Range[5000], PrimeQ[(2^# + 1)^4 - 2] &]
%o (PARI) is(n)=ispseudoprime((2^n+1)^4-2) \\ _Charles R Greathouse IV_, Jun 13 2017
%Y Cf. A091513, A091514, A093069, A099359.
%Y Cf. A100497, n such that (2^n+1)^4-2 is semiprime.
%K more,nonn
%O 1,2
%A _Jonathan Vos Post_, Nov 23 2004
%E Edited, corrected and extended by _Ray Chandler_ and _Hugo Pfoertner_, Nov 26 2004
%E a(10)-a(11) from _Tyler Busby_, Feb 12 2023