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.
2 is OK because 5^2 + 2^5 = 25 + 32 = 57 = 3*19 (semiprime).
IsSemiprime:=func< n|&+[k[2]: k in Factorization(n)] eq 2 >; [n: n in [1..85]|IsSemiprime(5^n+n^5)]; // Vincenzo Librandi, Dec 16 2010
Select[Range[100],PrimeOmega[5^# + #^5]==2&] (* Vincenzo Librandi, May 21 2014 *)
2^5 + 5^2 = 32 + 25 = 57 = 3*19 (semiprime).
IsSemiprime:=func< n | &+[ k[2]: k in Factorization(n) ] eq 2 >; [ n: n in [1..175]|IsSemiprime(2^n+n^2)]; // Vincenzo Librandi, Dec 16 2010
Select[Range[200], PrimeOmega[2^# + #^2]==2&] (* Vincenzo Librandi, May 21 2014 *)
4 is OK because 3^4 + 4^3 = 81 + 64 = 145 = 5*29 (semiprime).
IsSemiprime:=func< n | &+[ k[2]: k in Factorization(n) ] eq 2 >; [ n: n in [1..95] | IsSemiprime(3^n+n^3)]; // Vincenzo Librandi Dec 16 2010
Select[Range[100], PrimeOmega[3^# + #^3]==2&] (* Vincenzo Librandi, May 21 2014 *)
Comments