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.
For p=3, 2^3 + 35 = 43, which is prime.
[p: p in PrimesUpTo(700) | IsPrime(2^p+35)]; // Vincenzo Librandi, Oct 06 2015
Select[Prime[Range[100000]], PrimeQ[(2^# + 35)] &]
forprime(p=2, 10^30, if (isprime(2^p + 35), print1(p", "))); \\ Altug Alkan, Oct 05 2015
13 is in sequence because 2^13 + 17 = 8209 is prime.
[p: p in PrimesUpTo(1000) | IsPrime(2^p+17)];
Select[Prime[Range[1000]], PrimeQ[2^# + 17] &]
for(n=1, 1e3, if(isprime((2^prime(n))+17), print1(prime(n)", "))) \\ Altug Alkan, Sep 18 2015
3 is in sequence because 2^3 + 29 = 37 is prime. 5 is in sequence because 2^5 + 29 = 61 is prime.
[p: p in PrimesUpTo(1000) | IsPrime(2^p+29)];
Select[Prime[Range[1000]], PrimeQ[2^# + 29] &]
for(n=1, 1e3, if(isprime((2^prime(n))+29), print1(prime(n)", "))) \\ Altug Alkan, Sep 18 2015
use ntheory ":all"; use Math::GMP ":constant"; forprimes { say if is_prob_prime(2**$+29) } 1e4; # _Dana Jacobsen, Oct 03 2015
For p=3, 2^3 + 33 = 41, which is prime.
[p: p in PrimesUpTo(1000) | IsPrime(2^p+33)]; // Vincenzo Librandi, Oct 05 2015
Select[Prime[Range[100000]], PrimeQ[(2^# + 33)] &]
forprime(p=2, 10000, if (isprime(2^p + 33), print1(p", "))); \\ Altug Alkan, Oct 05 2015
Prime 5 is in sequence because 2^5 + 27 = 59, which is also prime.
[p: p in PrimesUpTo(100) | IsPrime(2^p+27)]; // Vincenzo Librandi, Oct 05 2015
Select[Prime[Range[100000]], PrimeQ[(2^# + 27)] &]
forprime(p=2, 10^30, if (isprime(2^p + 3^3), print1(p", "))); \\ Altug Alkan, Oct 04 2015
Comments