|
| |
|
|
A104230
|
|
Minimal number of primes needed to sum to square.
|
|
0
| |
|
|
0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| 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.
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Goldbach Conjecture .
|
|
|
EXAMPLE
| a(3)=2 because 2^2=2+2;
a(4)=2 because 3^2=2+7.
|
|
|
CROSSREFS
| Sequence in context: A164898 A100801 A194310 * A165113 A069903 A086007
Adjacent sequences: A104227 A104228 A104229 * A104231 A104232 A104233
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Apr 02 2005
|
| |
|
|
