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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080208 a(n) is the least k such that the generalized Fermat number (k+1)^(2^n) + k^(2^n) is prime. 5
1, 1, 1, 1, 1, 8, 95, 31, 85, 59, 1078, 754, 311, 3508, 1828, 49957 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

COMMENTS

The first five terms correspond to the five known Fermat primes. The sequence A078902 lists some of the generalized Fermat primes. Bjorn and Riesel examined generalized Fermat numbers for k <= 11 and n <= 999. The sequence A080134 lists the conjectured number of primes for each k.

For n >= 10, a(n) yields a probable prime. a(13) was found by Henri Lifchitz. It is known that a(14) > 1000.

LINKS

Table of n, a(n) for n=0..15.

T. D. Noe, Table of generalized Fermat primes of the form (k+1)^2^m + k^2^m

Anders Björn and Hans Riesel, Factors of generalized Fermat numbers, Math. Comp. 67 (1998), no. 221, pp. 441-446.

Eric Weisstein's World of Mathematics, Generalized Fermat Number

FORMULA

a(n) = A253633(n) - 1.

EXAMPLE

a(5) = 8 because (k+1)^32 + k^32 is prime for k = 8 and composite for k < 8.

CROSSREFS

Cf. A019434, A078902, A080134, A153504, A152913, A194185, A253633.

Sequence in context: A010565 A299002 A299669 * A297857 A298092 A298054

Adjacent sequences: A080205 A080206 A080207 * A080209 A080210 A080211

KEYWORD

hard,more,nonn

AUTHOR

T. D. Noe, Feb 10 2003

EXTENSIONS

a(14)-a(15) from Jeppe Stig Nielsen, Nov 27 2020

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 December 4 23:46 EST 2022. Contains 358572 sequences. (Running on oeis4.)