|
| |
|
|
A056993
|
|
a(n) = smallest k >= 2 such that k^(2^n)+1 is prime.
|
|
10
| |
|
|
2, 2, 2, 2, 2, 30, 102, 120, 278, 46, 824, 150, 1534, 30406, 67234, 70906, 48594, 62722, 24518, 75898
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Smallest base value yielding generalized Fermat primes. - Hugo Pfoertner (hugo(AT)pfoertner.org), Jul 01 2003
The first 5 terms correspond with the known (ordinary) Fermat primes. A probable candidate for the next entry is 62722^131072+1, discovered by Michael Angel in 2003. It has 628808 decimal digits. - Hugo Pfoertner (hugo(AT)pfoertner.org), Jul 01 2003
|
|
|
LINKS
| Yves Gallot, Generalized Fermat Prime Search
Yves Gallot, Generalized Fermat Prime Search
Micheal Goetz, id=103235 of Top 5000 Primes
Stephen Scott, id=84401 of Top 5000 Primes
|
|
|
EXAMPLE
| The primes are 2^(2^0)+1=3, 2^(2^1)+1=5, 2^(2^2)+1=17, 2^(2^3)+1=257, 2^(2^4)+1=65537, 30^(2^5)+1, 102^(2^6)+1, ....
|
|
|
MATHEMATICA
| f[n_] := (p = 2^n; k = 2; While[cp = k^p + 1; !PrimeQ@cp, k++ ]; k); Do[ Print[{n, f@n}], {n, 0, 17}] (* from Lei Zhou, Feb 21 2005 *)
|
|
|
CROSSREFS
| Cf. A006093, A005574, A000068, A006314, A006313, A006315, A006316, A056994, A056995, A057465, A057002.
Cf. A019434 (Fermat primes).
Sequence in context: A095386 A060359 A029665 * A057331 A067089 A090872
Adjacent sequences: A056990 A056991 A056992 * A056994 A056995 A056996
|
|
|
KEYWORD
| hard,nonn,changed
|
|
|
AUTHOR
| Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 06 2000
|
|
|
EXTENSIONS
| 1534 from Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 30 2000
62722 from Jeppe Stig Nielsen (sequence(AT)jeppesn.dk), Aug 07 2005
24518 and 75898 from Lei Zhou, Feb 01 2012
|
| |
|
|
