login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A082546
Numbers n such that n=A082534(x)=A082534(y), where x<y.
0
5, 83, 311, 10859
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
5 = A082534(2) = A082534(3), 83 = A082534(9) = A082534(11).
Sequence in context: A163011 A368081 A142162 * A348790 A173876 A368080
KEYWORD
more,nonn
AUTHOR
Naohiro Nomoto, May 02 2003
STATUS
approved