OFFSET
1,1
COMMENTS
Conjecture: (i) a(n) > 0 for all n > 0. In other words, for any perfect powers x^m and y^n with 0 < x^m < y^n, there is an integer z with x^m <= z <= y^n such that 2*z^2 - 1 is prime.
(ii) For any perfect powers x^m and y^n with 0 < x^m < y^n, there is an integer z with x^m <= z <= y^n such that 2*z + 3 (or 20*z^2 + 3) is prime.
(iii) For perfect powers x^m and y^n with 0 < x^m < y^n, there is a practical number q (cf. A005153) with x^m <= q <= y^n, unless x^m = 5^2 and y^n = 3^3, or x^m = 11^2 and y^n = 5^3, or x^m = 22434^2 and y^n = 55^5.
Compare this with the Redmond-Sun conjecture.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..5000
Wikipedia, Redmond-Sun conjecture
EXAMPLE
MATHEMATICA
n=1; m=1; Do[Do[If[IntegerQ[k^(1/Prime[i])], Print[n, " ", Sum[Boole[PrimeQ[2j^2-1]], {j, m, k}]]; n=n+1; m=k; Goto[aa]], {i, 1, PrimePi[Log[2, k]]}]; Label[aa], {k, 2, 6561}]
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Zhi-Wei Sun, Oct 01 2017
STATUS
approved