OFFSET
0,1
COMMENTS
There are k such that k*2^m + 1 is not prime for any m (then k is called a Sierpiński number). Erdős once conjectured that for such a k, the smallest prime factor of k*2^m + 1 would be bounded as m tends to infinitiy. The proven Sierpiński number k=44745755^4 is thought to be the first counterexample to this conjecture.
This sequence is either unbounded (in which case 44745755^4 is in fact a counterexample) or periodic.
a(229) <= 3034663491871541. - Chai Wah Wu, Aug 09 2020
LINKS
Jeppe Stig Nielsen, Table of n, a(n) for n = 0..228
M. Filaseta et al., On powers associated with Sierpiński numbers, Riesel numbers and Polignac's conjecture, Journal of Number Theory, Volume 128, Issue 7 (July 2008), pp. 1916-1940.
Anatoly S. Izotov, A Note on Sierpinski Numbers, Fibonacci Quarterly (1995), pp. 206-207.
CROSSREFS
KEYWORD
nonn
AUTHOR
Jeppe Stig Nielsen, Jul 19 2020
STATUS
approved