|
%I #16 Mar 31 2014 17:38:49
%S 2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,2,2,2,2,2,3,2,3,2,2,2,2,2,3,2,2,2,2,
%T 2,2,2,3,2,3,2,2,2,3,2,2,2,2,2,3,2,3,2,2,2,3,2,3,2,2,2,2,2,3,2,3,2,2,2
%N Minimal number of primes needed to sum to n^2.
%C For the Goldbach conjecture every even number that is greater than 2 is the sum of three primes and odd number is the sum of three primes, no term is greater 3.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GoldbachConjecture.html">Goldbach Conjecture </a>.
%F a(n) = A051034(A000290(n)). - _Michel Marcus_, Jun 04 2013
%e a(2)=2 because 2^2=2+2;
%e a(3)=2 because 3^2=2+7.
%K easy,nonn
%O 2,1
%A _Giovanni Teofilatto_, Apr 02 2005
%E Corrected and extended by _Michel Marcus_, Jun 04 2013
|
