OFFSET
1,5
COMMENTS
Conjecture: a(n)>0 for all n>4.
This has been verified for n up to 10^8.
We also conjecture that for any integer n>1 there is an integer 0<k<n such that n^2+k^2 is prime.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
D. R. Heath-Brown, Primes represented by x^3 + 2y^3. Acta Mathematica 186 (2001), pp. 1-84.
Zhi-Wei Sun, Conjectures involving primes and quadratic forms, arXiv:1211.1588 [math.NT], 2012-2017.
EXAMPLE
a(7) = 1 since 2*7+5 = 19 and 2*7^3+5^3 = 811 are both prime.
a(57) = 1 since 2*57+23 = 137 and 2*57^3+23^3 = 382553 are both prime.
MATHEMATICA
a[n_]:=a[n]=Sum[If[PrimeQ[2n+k]==True&&PrimeQ[2n^3+k^3]==True, 1, 0], {k, 1, n-1}]
Table[a[n], {n, 1, 100}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Apr 15 2013
STATUS
approved