# eliminated Sierpiński number candidates

Most numbers $k$ are very easy to eliminate as Sierpiński number candidates, as it is very easy to come up with sequences of primes of the form $k2^{n}+1$. For example, for $k=1$ it is enough to mention the Fermat primes. For some of the seventeen Sierpiński number candidates when the Seventeen or Bust project began, only a single Proth prime, and it is often quite large. Eight candidates remain to be eliminated. The primes listed below were discovered by the Seventeen or Bust project, with the latest being for 19249, discovered by user Konstantin Agafonov of team TSC! Russia.

$k$ 4847 Exponent $n$ which gives prime Prime in base 10 scientific notation 3321063 $1.844857508381060\times 10^{999743}$ 5054502 $2.781168752802502\times 10^{1521560}$ Still a candidate N/A 13018586 $1.484360328715661\times 10^{3918989}$ Still a candidate N/A Still a candidate N/A Still a candidate N/A 9167433 $5.727724120920733\times 10^{2759676}$ 7830457 $7.772839072447348\times 10^{2357206}$ Still a candidate N/A Still a candidate N/A Still a candidate N/A 995972 $1.234767571821004\times 10^{299822}$ 1013803 $8.499227304459893\times 10^{305189}$ Still a candidate N/A 1157446 $6.366429016367452\times 10^{348430}$
Title eliminated Sierpiński number candidates EliminatedSierpinskiNumberCandidates 2013-03-22 17:21:14 2013-03-22 17:21:14 PrimeFan (13766) PrimeFan (13766) 6 PrimeFan (13766) Example msc 11A51