login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078902 Generalized Fermat primes of the form (k+1)^2^m + k^2^m, with m>1. 9
17, 97, 257, 337, 881, 3697, 10657, 16561, 49297, 65537, 66977, 89041, 149057, 847601, 988417, 1146097, 1972097, 2070241, 2522257, 2836961, 3553777, 3959297, 4398577, 5385761, 7166897, 11073217, 17653681, 32530177, 41532497, 44048497 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For k=1, these are the Fermat primes A019434. Is the set of generalized Fermat primes infinite? Conjecture that there are only a finite number of generalized Fermat primes for each value of k. See A077659, which shows that in cases such as k=11, there appear to be no primes. See A078901 for generalized Fermat numbers.
See A080131 for the conjectured number of primes for each k. See A080208 for the least k such that (k+1)^2^n + k^2^n is prime. The largest probable prime of this form discovered to date is the 10217-digit 312^2^12 + 311^2^12.
LINKS
T. D. Noe, Table of n, a(n) for n = 1..525 (terms < 10^14)
Eric Weisstein's World of Mathematics, Generalized Fermat Number
MATHEMATICA
lst3=Select[lst2, PrimeQ[ # ]&] (* lst2 is from A078901 *)
CROSSREFS
Sequence in context: A264823 A081593 A078901 * A103766 A165347 A008514
KEYWORD
nonn
AUTHOR
T. D. Noe, Dec 12 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 06:44 EDT 2024. Contains 371782 sequences. (Running on oeis4.)