login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122902 First occurrence of exponent n in A080121 corresponding to the minimum prime of the form (k^(2^n) + (k+1)^(2^n)) = A122900(k). 2
1, 3, 23, 21, 10, 95, 255, 86, 59 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Minimum primes of the form n^(2^m) + (n+1)^(2^m) are listed in A122900. The exponents m are listed in A080121.

a(10)-a(13)>1000, a(14)-a(16)>100.

LINKS

Table of n, a(n) for n=1..9.

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

Eric Weisstein's World of Mathematics, Generalized Fermat Number

EXAMPLE

A080121 begins with 1,1,2,1,1,2,1,2,1,5,?,1,2,1,?,2,1,?,1,?,4,1,3,1,..., where the unknown terms (denoted with ?) are at least 10. So a(1) = 1, a(2) = 3, a(3) = 23, a(4) = 21, a(5) = 10.

CROSSREFS

Cf. A077659, A080121, A122900, A080208, A078902, A080134, A019434, A153504, A152913, A194185.

Sequence in context: A130475 A212998 A157819 * A297855 A298090 A298052

Adjacent sequences:  A122899 A122900 A122901 * A122903 A122904 A122905

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk, Sep 18 2006, Oct 01 2006

EXTENSIONS

Edited by Max Alekseyev, Sep 09 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 5 06:18 EST 2021. Contains 341816 sequences. (Running on oeis4.)