

A334053


Least b such that b^(2^n) + 1 is a Proth prime (A080076).


1



2, 2, 2, 2, 2, 96, 6912, 960, 16256, 2013184, 235520, 61184, 125440, 992256, 155615232, 550207488, 12192710656
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

Every term b is in A116882 (the prime factor 2 of b must account for more than the square root of b).
For n up to about 11, a(n) can be found with the PARI function below. From there up to n=14, you can find a(n) by filtering lists of known primes of the form b^(2^n) + 1.


LINKS



PROG

(PARI) a(n) = forstep(b=2, +oo, 2, 2*valuation(b, 2)>logint(b, 2)&&ispseudoprime(b^(2^n)+1)&&return(b))


CROSSREFS



KEYWORD

more,nonn


AUTHOR



EXTENSIONS



STATUS

approved



