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”).

A228846
Largest m such that (2k+1)*2^m + 1 is a prime factor of the Fermat number 2^(2^n) + 1.
4
1, 2, 4, 8, 16, 7, 8, 9, 11, 16, 14, 14
OFFSET
0,2
COMMENTS
a(n) >= n + 2 for n >= 2.
a(n) = A228845(n) if 2^(2^n) + 1 is prime or semiprime.
a(n) = max (A007814(p_i-1)), where p_i are the prime factors of 2^(2^n)+1. - Ralf Stephan, Sep 09 2013
For n >= 2, a(n) >= n + 3 if A046052(n) is an odd number. - Arkadiusz Wesolowski, Aug 10 2021
LINKS
Wilfrid Keller, Fermat factoring status
Eric Weisstein's World of Mathematics, Fermat Number
EXAMPLE
F(5) = 641*6700417 and max(A007814(640),A007814(6700416))=7, so a(5)=7.
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
STATUS
approved