|
Search: id:A007963
|
|
|
| A007963 |
|
Number of (unordered) ways of writing 2n+1 as a sum of 3 odd primes. |
|
+0
4
|
|
| 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 6, 8, 7, 9, 10, 10, 10, 11, 12, 12, 14, 16, 14, 16, 16, 16, 18, 20, 20, 20, 21, 21, 21, 27, 24, 25, 28, 27, 28, 33, 29, 32, 35, 34, 30, 37, 36, 34, 42, 38, 36, 46, 42, 42, 50, 46, 47, 53, 50, 45, 56, 54, 46, 62, 53, 48, 64, 59, 55, 68, 61, 59, 68
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
COMMENT
|
Ways of writing 2n+1 as p+q+r where p,q,r are odd primes with p <= q <= r.
|
|
REFERENCES
|
George E. Andrews, Number Theory (NY, Dover, 1994), page 111.
Ivars Peterson, The Mathematical Tourist (NY, W. H. Freeman, 1998, pages 35-37.
Paulo Ribenboim, "VI, Goldbach's famous conjecture," The New Book of Prime Number Records, 3rd ed. (NY, Springer, 1996), pages 291-299.
F. Smarandache, "Only Problems, not Solutions!", Xiquan Publ., Phoenix-Chicago, 1993
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..10000
M. L. Perez et al., eds., Smarandache Notions Journal
Index entries for sequences related to Goldbach conjecture
F. Smarandache, Only Problems, Not Solutions!.
|
|
EXAMPLE
|
a(10) = 4 because 21 = 3+5+13 = 3+7+11 = 5+5+11 = 7+7+7
|
|
CROSSREFS
|
Sequence in context: A100679 A092982 A030566 this_sequence A137222 A077641 A112672
Adjacent sequences: A007960 A007961 A007962 this_sequence A007964 A007965 A007966
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. Muller
|
|
EXTENSIONS
|
Corrected and extended by David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
