|
| |
|
|
A059965
|
|
For m>0, each n+m > 5 is expressed as Sum_{k = x,y,z}(pk)_m where (pk)_m is a prime with x <= y <= z; a(n) = largest m such that (pk)_1 = (pk)_2 = ... = (pk)_m.
|
|
0
| |
|
|
0, 0, 0, 0, 0, 7, 7, 6, 7, 6, 7, 6, 5, 5, 7, 6, 7, 6, 5, 5, 7, 6, 7, 6, 5, 4, 7, 6, 5, 4, 5, 5, 7, 6, 7, 6, 5, 4, 3, 3, 7, 6, 5, 5, 7, 6, 7, 6, 5, 4, 7, 6, 5, 4, 5, 4, 7, 6, 5, 4, 5, 5, 7, 6, 7, 6, 5, 4, 3, 3, 7, 6, 5, 5, 7, 6, 7, 6, 5, 4, 3, 3, 7, 6, 5, 4, 7, 6, 5, 4, 5, 4, 7, 6, 5, 4, 5, 4, 3, 3, 7, 6, 5, 5, 7
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
