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”).
%I #7 Nov 16 2017 15:52:23
%S 5,83,311,10859
%N Numbers n such that n=A082534(x)=A082534(y), where x<y.
%C Can someone prove this sequence is complete?
%F 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.
%e 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.
%Y 5 = A082534(2) = A082534(3), 83 = A082534(9) = A082534(11).
%K more,nonn
%O 1,1
%A _Naohiro Nomoto_, May 02 2003