A100408
Numbers n such that n^n-2 is prime.
Original entry on oeis.org
2, 7, 19, 21, 25, 49, 51, 1071
Offset: 1
51 is in the sequence because 51^51-2 is prime. 1071^1071-2 is a probable prime.
A166852
Numbers k such that k^k + 3 is prime.
Original entry on oeis.org
-
Do[If[GCD[n,3]==1&&PrimeQ[n^n+3],Print[n]],{n,2,5362,2}]
-
is(n)=ispseudoprime(n^n+3) \\ Charles R Greathouse IV, Jun 13 2017
A166853
a(n) is the smallest number m such that m^m-n is prime, or zero if there is no such m.
Original entry on oeis.org
2, 2, 8, 3, 4, 5, 6, 3, 0, 3, 78, 13, 6, 3, 4, 3, 4, 17, 12, 3, 118, 3, 4, 3, 3
Offset: 1
We have a(1)=2 since 1^1-1 is not prime, but 2^2-1 is prime.
a(9)=0 since 2^2-9 is not prime, and if m is an even number greater than 2 then m^m-9=(m^(m/2)-3)*(m^(m/2)+3) is composite. So there is no number m such that m^m-9 is prime. The same applies to any odd square > 25.
We have a(25)=3 since 3^3-25=2 is prime. But 25 is the only known square of the form m^m-2, so a(n)=0 for other odd squares > 25, e.g., n = 49,81,121,....
a(115)=2736 is the largest known term. 2736^2736-115 is a probable prime.
A300292
Numbers k such that k^k + 9 is a prime.
Original entry on oeis.org
A300976
Numbers k such that k^k - 5 is a prime.
Original entry on oeis.org
4, 104, 124, 728
Offset: 1
-
Select[Range[1000], PrimeQ[#^# - 5] &] (* Vaclav Kotesovec, Mar 25 2018 *)
-
isok(k) = ispseudoprime(k^k - 5); \\ Altug Alkan, Mar 17 2018
A300981
Numbers k such that k^k - 10 is a prime.
Original entry on oeis.org
-
Select[Range[1000], PrimeQ[#^# - 10] &] (* Vaclav Kotesovec, Mar 25 2018 *)
-
isok(k) = ispseudoprime(k^k - 10); \\ Altug Alkan, Mar 17 2018
Showing 1-6 of 6 results.
Comments