|
%I M1087 N0415 #39 Dec 22 2018 14:40:44
%S 2,4,8,10,12,14,18,32,48,54,72,148,184,248,270,274,420,1340,1438,1522,
%T 1638,1754,1884,2014,2170,2548,2622,2652,2704,13510,21738,25624,41934,
%U 51478,52540,53230,172300,245728,350028,1194164
%N Numbers k such that 5*2^k - 1 is prime.
%C A084213(a(n)+1) is in A136539, for all n. - _Farideh Firoozbakht_ and _M. F. Hasler_, Nov 03 2012
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%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 H. C. Williams and C. R. Zarnke, <a href="http://dx.doi.org/10.1090/S0025-5718-1968-0227095-2">A report on prime numbers of the forms M = (6a+1)*2^(2m-1)-1 and (6a-1)*2^(2m)-1</a>, Math. Comp., 22 (1968), 420-422.
%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>
%p A001770:=n->`if`(isprime(5*2^n-1),n,NULL): seq(A001770(n), n=1..1000); # _Wesley Ivan Hurt_, Oct 15 2014
%t Select[Range[1000], PrimeQ[5*2^# - 1] &] (* _Vaclav Kotesovec_, Apr 28 2014 *)
%o (PARI) is(n)=isprime(5*2^n-1) \\ _Charles R Greathouse IV_, Feb 07 2017
%Y Cf. A002254 (5*2^n+1 is prime), A050522 (primes of the form 5*2^n - 1).
%K nonn,nice,hard,more
%O 1,1
%A _N. J. A. Sloane_.
%E More terms from _Hugo Pfoertner_, Jun 23 2004
%E a(40) from the Wilfrid Keller link by _Robert Price_, Dec 22 2018
|
