cp's OEIS Frontend

A322957 Numbers k such that 329*2^k+1 is prime.

%I A322957 #18 Feb 16 2025 08:33:57
%S A322957 1,3,5,9,11,15,27,55,87,105,111,163,225,311,487,537,723,735,771,1515,
%T A322957 1599,4685,5523,5895,9723,20107,55035,66355,108393,181189,455645,
%U A322957 604999,623005,829207,1019093,1246017,2099771,2163717,2266631,2348105,2688221,3002295
%N A322957 Numbers k such that 329*2^k+1 is prime.
%H A322957 Jeppe Stig Nielsen, <a href="/A322957/b322957.txt">Table of n, a(n) for n = 1..45</a>
%H A322957 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a>
%H A322957 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 A322957 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a>
%H A322957 Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a>
%H A322957 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ProthPrime.html">Proth Prime</a>
%H A322957 <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>
%p A322957 select(n->isprime(329*2^n+1),[$1..1000]); # _Muniru A Asiru_, Dec 31 2018
%t A322957 Select[Range[1000], PrimeQ[329*2^# + 1] &] (* _Robert Price_, Dec 31 2018 *)
%Y A322957 Cf. A002255, A050527.
%K A322957 nonn,hard
%O A322957 1,2
%A A322957 _Robert Price_, Dec 31 2018
%E A322957 a(37)-a(41) from _Jeppe Stig Nielsen_, Jan 04 2020
%E A322957 a(42) from _Jeppe Stig Nielsen_, Dec 20 2024