|
Search: id:A054860
|
|
|
| A054860 |
|
Number of ways of writing 2n+1 as p+q+r where p,q,r are primes with p <= q <= r. |
|
+0
5
|
|
| 0, 0, 0, 1, 2, 2, 2, 3, 4, 3, 5, 5, 5, 7, 7, 6, 9, 8, 9, 10, 11, 10, 12, 13, 12, 15, 16, 14, 17, 16, 16, 19, 21, 20, 20, 22, 21, 22, 28, 24, 25, 29, 27, 29, 33, 29, 33, 35, 34, 30, 38, 36, 35, 43, 38, 37, 47, 42, 43, 50, 46, 47, 53, 50, 45, 57, 54, 47, 62, 53, 49, 65, 59, 55, 68
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Every sufficiently large odd number is the sum of three primes (th. by Vinogradov, 1937). Goldbach's conjecture requires three ODD primes, and then a(n) > 0 for n > 2 is weaker.
|
|
REFERENCES
|
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, appendix 3.
Wolfgang Schwarz, Einfuehrung in Methoden und Ergebnisse der Primzahltheorie, Bibl. Institut, 1969, ch. 7.
|
|
CROSSREFS
|
Cf. A007963.
Sequence in context: A112213 A085755 A138304 this_sequence A098745 A029158 A071454
Adjacent sequences: A054857 A054858 A054859 this_sequence A054861 A054862 A054863
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
James A. Sellers (sellersj(AT)math.psu.edu), May 25 2000
|
|
|
Search completed in 0.002 seconds
|
