|
%I #18 Feb 05 2018 02:58:38
%S 0,0,0,1,1,1,0,1,2,1,0,2,1,1,2,1,1,2,0,2,3,1,1,2,2,1,2,1,1,4,1,2,3,1,
%T 2,3,1,2,2,1,2,4,0,2,5,1,1,3,2,3,4,3,1,4,3,3,5,2,1,6,1,2,5,1,3,4,2,2,
%U 4,4,3,6,3,3,7,2,4,6,1,4,5,2,2,5,4,3,5,3,2,6
%N Number of Goldbach partitions (p,q) of 2n such that 0 < |p-q| < n.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GoldbachPartition.html">Goldbach Partition</a>
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Goldbach%27s_conjecture">Goldbach's conjecture</a>
%H <a href="/index/Go#Goldbach">Index entries for sequences related to Goldbach conjecture</a>
%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%F a(n) = Sum_{i=3..n-1} A010051(i) * A010051(2n-i) * sign(floor(n/(2*(n-i)))).
%p with(numtheory): A279792:=n->add( (pi(i)-pi(i-1)) * (pi(2*n-i)-pi(2*n-i-1)) * signum(floor(n/(2*(n-i)))), i=3..n-1): seq(A279792(n), n=1..100);
%t Table[Sum[Boole[PrimeQ@ i] Boole[PrimeQ[2 n - i]] Sign@ Floor[n/(2 (n - i))], {i, 3, n - 1}], {n, 90}] (* _Michael De Vlieger_, Dec 21 2016 *)
%Y Cf. A010051, A002375, A279794.
%K nonn,easy
%O 1,9
%A _Wesley Ivan Hurt_, Dec 18 2016
|
