|
%I #15 Apr 20 2020 02:17:30
%S 1,2,13,14,18,21,22,26,56,73,74,121,133,169,192,193,226,242,282,346,
%T 356,416,517,812,1653,2458,2468,4492,4994,5648,6498,12188,12741,12973,
%U 17026,18421,19112,22918,23017,33796,47288,77054,77638,80998,102157,104204
%N Numbers k such that 483*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A320339/b320339.txt">Table of n, a(n) for n = 1..56</a> (terms n = 1..55 from Robert Price)
%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="http://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[483*2^# + 1] &]
%K nonn,hard
%O 1,2
%A _Robert Price_, Jan 07 2019
|
