The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227908 Number of ways to write 2*n = p + q with p, q and (p-1)^2 + q^2 all prime. 6
 0, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 3, 2, 2, 0, 2, 6, 1, 3, 5, 2, 3, 2, 1, 2, 2, 5, 4, 3, 2, 3, 8, 1, 4, 3, 3, 2, 5, 1, 2, 4, 5, 3, 4, 4, 2, 6, 1, 4, 5, 3, 3, 6, 2, 6, 5, 4, 5, 7, 3, 1, 9, 2, 3, 6, 1, 2, 5, 4, 7, 2, 7, 6, 6, 2, 4, 10, 3, 3, 6, 1, 7, 9, 5, 4, 5, 4, 3, 5, 3, 5, 8, 4, 4, 5, 2, 11, 9, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Conjecture: a(n) > 0 except for n = 1, 16, 292. This implies not only Goldbach's conjecture for even numbers, but also Ming-Zhi Zhang's conjecture (cf. A036468) that any odd number greater than one can be written as x + y (x, y > 0) with x^2 + y^2 prime. We have verified the conjecture for n up to 10^7. Conjecture verified for n up tp 10^9. - Mauro Fiorentini, Sep 21 2023 LINKS Zhi-Wei Sun, Table of n, a(n) for n = 1..10000 Zhi-Wei Sun, Conjectures involving primes and quadratic forms, arXiv:1211.1588 [math.NT], 2012-2017. EXAMPLE a(7) = 1 since 2*7 = 11 + 3, and (11-1)^2 + 3^2 = 109 is prime. a(19) = 1 since 2*19 = 7 + 31, and (7-1)^2 + 31^2 = 997 is prime. MATHEMATICA a[n_]:=Sum[If[PrimeQ[2n-Prime[i]]&&PrimeQ[(Prime[i]-1)^2+(2n-Prime[i])^2], 1, 0], {i, 1, PrimePi[2n-2]}] Table[a[n], {n, 1, 100}] CROSSREFS Cf. A002375, A036468, A220554, A230224. Sequence in context: A201503 A112758 A029437 * A240473 A286569 A342749 Adjacent sequences: A227905 A227906 A227907 * A227909 A227910 A227911 KEYWORD nonn AUTHOR Zhi-Wei Sun, Oct 12 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 19 15:11 EDT 2024. Contains 371794 sequences. (Running on oeis4.)