cp's OEIS Frontend

A190353 Goldbach conjecture: number of decompositions of n into an unordered sum of two odd primes (if n even) or three odd primes (if n odd).

%I A190353 #7 Mar 30 2012 17:23:07
%S A190353 0,0,0,0,0,1,0,1,1,2,1,1,2,2,2,2,3,2,3,2,4,3,4,3,5,3,6,2,7,3,6,2,8,4,
%T A190353 7,4,9,2,10,3,10,4,10,3,11,4,12,5,12,4,14,3,16,5,14,3,16,4,16,6,16,3,
%U A190353 18,5,20,6,20,2,20,5,21,6,21,5,21,5,27,7,24
%N A190353 Goldbach conjecture: number of decompositions of n into an unordered sum of two odd primes (if n even) or three odd primes (if n odd).
%C A190353 This sequence differs from A083338 because A083338 allows 2 as a prime.
%H A190353 Daniel Forgues, <a href="/A190353/b190353.txt">Table of n, a(n) for n = 1..20000</a>
%H A190353 OEIS Wiki, <a href="/wiki/Goldbach_conjecture">Goldbach conjecture</a>
%F A190353 a(2n) = A002375(n) and a(2n+1) = A007963(n).
%Y A190353 Cf. A002375, A007963, A083338.
%K A190353 nonn
%O A190353 1,10
%A A190353 _Daniel Forgues_, May 09 2011