login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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.
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.
KEYWORD
hard,more,nonn
AUTHOR
Alexander Adamchuk, Sep 18 2006, Oct 01 2006
EXTENSIONS
Edited by Max Alekseyev, Sep 09 2020
STATUS
approved