%I #38 Sep 08 2022 08:44:51
%S 4,6,10,16,30,124,174,192,336,600,720,1092,1138,1588,1652,1812,3012,
%T 3308,7266,7446,10136,10656,12140,21756,63870,66020,81156,90346,
%U 109600,127600,193148,193674,200878,278806,894310,1027150,1471408,1684616,2455666,2701452
%N Numbers k such that 133*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A032416/b032416.txt">Table of n, a(n) for n = 1..41</a>
%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/riesel1.html">List of primes k.2^n + 1 for k < 300</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 <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[133*2^# + 1] & ] (* _Robert Price_, Dec 17 2018 *)
%o (PARI) is(n)=ispseudoprime(133*2^n+1) \\ _Charles R Greathouse IV_, Jun 13 2017
%o (Magma) [n: n in [1..6000] |IsPrime(133*2^n+1)]; // _Vincenzo Librandi_, Dec 18 2018
%K nonn,more
%O 1,1
%A _James R. Buddenhagen_
%E Extended by _Hugo Pfoertner_, Jul 02 2003
%E a(31)-a(38) from the Ray Ballinger and Wilfrid Keller link by _Robert Price_, Dec 17 2018
%E a(39)-a(40) from _Jeppe Stig Nielsen_, Mar 12 2020