The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #14 Feb 16 2025 08:33:56
%S 2,190,242,326,1562,31430,43666,497206,504610,4414802
%N Numbers k such that 469*2^k+1 is prime.
%H Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a>.
%H Ray Ballinger and Wilfrid Keller, <a href="http://www.prothsearch.com/riesel1a.html">List of primes k.2^n + 1 for 300 < k < 600</a>.
%H Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a>.
%H Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a>.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a>.
%H <a href="/index/Pri#riesel">Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime</a>.
%t Select[Range[1000], PrimeQ[469*2^# + 1] &]
%K nonn,more,hard
%O 1,1
%A _Robert Price_, Jan 07 2019
%E a(10) from _Jeppe Stig Nielsen_, Dec 18 2024