OFFSET
1,1
COMMENTS
Can someone prove this sequence is complete?
FORMULA
Let pi = i-th prime, pj = j-th prime, x<y, i<=x, j<=y, n = Largest prime of Sum_{i..x} pi, m= Largest prime of Sum_{j..y} pj. n such that n = m.
EXAMPLE
For n=5; 5= Sum_{i=1..2} pi = Sum_{j=3..3} pj. For n=83; 83= Sum_{i=5..9} pi = Sum_{j=9..11} pj.
CROSSREFS
KEYWORD
more,nonn
AUTHOR
Naohiro Nomoto, May 02 2003
STATUS
approved