|
Search: id:A104230
|
|
|
| A104230 |
|
Minimal number of primes needed to sum to square. |
|
+0
1
|
|
| 0, 0, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
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: A126696 A164898 A100801 this_sequence A165113 A069903 A086007
Adjacent sequences: A104227 A104228 A104229 this_sequence A104231 A104232 A104233
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Apr 02 2005
|
|
|
Search completed in 0.002 seconds
|
