This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A082546 #7 Nov 16 2017 15:52:23
%S A082546 5,83,311,10859
%N A082546 Numbers n such that n=A082534(x)=A082534(y), where x<y.
%C A082546 Can someone prove this sequence is complete?
%F A082546 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 A082546 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 A082546 5 = A082534(2) = A082534(3), 83 = A082534(9) = A082534(11).
%K A082546 more,nonn
%O A082546 1,1
%A A082546 _Naohiro Nomoto_, May 02 2003