This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
lst={};Do[p=Prime[n];If[PrimeQ[p=p+2^p],AppendTo[lst,p]],{n,5!}];lst (* Vladimir Joseph Stephan Orlovsky, Jan 28 2009 *)
Select[#+2^#&/@Prime[Range[100]],PrimeQ] (* Harvey P. Dale, Feb 19 2018 *)
p=3 is prime, and so is 2^p - p = 8 - 3 = 5, so 5 is in the sequence. - _Michael B. Porter_, Jul 19 2016
a:=proc(n) if isprime(2^ithprime(n)-ithprime(n))=true then 2^ithprime(n)-ithprime(n) else fi end: seq(a(n),n=1..310); # Emeric Deutsch
lst={};Do[p=Prime[n];If[PrimeQ[p=2^p-p],AppendTo[lst,p]],{n,5!}];lst (* Vladimir Joseph Stephan Orlovsky, Jan 28 2009 *)
Select[Table[2^p-p,{p,Prime[Range[20]]}],PrimeQ] (* Harvey P. Dale, Sep 20 2018 *)
q=3, 2^3 + 3 = 11 a prime.
[p: p in PrimesUpTo(1000) | IsPrime(2^p+p) ] // Vincenzo Librandi, Aug 07 2010
Select[Prime@ Range[10^3], PrimeQ[# + 2^#] &] (* Michael De Vlieger, Nov 08 2017 *)
lista(nn) = forprime(p=3, nn, if(ispseudoprime(p + 2^p), print1(p, ", "))) \\ Iain Fox, Nov 13 2017
[n for n in (1..1000) if is_prime(n) and is_prime(2^n+n)] # G. C. Greubel, May 24 2019
Comments