|
| |
|
|
A102605
|
|
Number of ways of writing 2n+1 as p+q+r where p,q,r are primes with p < q < r, offset=0.
|
|
1
| |
|
|
0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 6, 6, 9, 8, 8, 11, 11, 10, 13, 13, 12, 14, 15, 13, 18, 17, 14, 21, 19, 17, 25, 20, 21, 26, 25, 22, 30, 28, 21, 32, 31, 23, 37, 32, 27, 39, 36, 32, 43, 41, 36, 45, 44, 35, 51, 48, 34, 54, 48, 36, 59, 50, 43, 60, 55, 46, 61
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|