proposed
approved
proposed
approved
editing
proposed
Number of Goldbach partitions (p,q) of 2n such that |q-p|/2 is prime. For example, a(8) = 2; 2*8 = 16 has 2 Goldbach partitions (3,13) and (5,11). Both |13-3|/2 = 5 and |11-5|/2 = 3 are prime, so a(8) = 2. - Wesley Ivan Hurt, Apr 03 2018
a(n) = Sum_{i=1..n} A010051(n-i) * A010051(2n-i) * A010051(i). - Wesley Ivan Hurt, Apr 03 2018
approved
editing
editing
approved
(*example Example of a program to find first 1000 terms of a(n)*)
countOfPrimes = 0;
countOfPrimes2 = 0;
countOfPrimes3 = 0;
PnToUse = z;
distanceToCheck = PnToUse;
For[i = 0, i < distanceToCheck, i++,
reviewed
editing
proposed
reviewed
editing
proposed
(*example program to find first 1000 terms of a(n)*)
For[z = 0, z < 1000, z++,
countOfPrimes = 0;
countOfPrimes2 = 0;
countOfPrimes3 = 0;
PnToUse = z;
distanceToCheck = PnToUse;
For[i = 0, i < distanceToCheck, i++,
If[PrimeQ[2*PnToUse - i],
countOfPrimes++ If[PrimeQ[(2*PnToUse - i) - PnToUse],
countOfPrimes2++ If[PrimeQ[i], countOfPrimes3++]], ]]
Print[countOfPrimes3]]
(* Jamie Morken, May 20 2017 *)
approved
editing
Michael De Vlieger, <a href="/A275768/b275768_1.txt">Table of n, a(n) for n = 0..10000</a>
proposed
approved