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 A143851 #13 Mar 31 2012 23:01:14
%S A143851 2,13,167,2239,439867,724031017,1990127567,54892225873
%N A143851 Primes p that divide the sum of their residues modulo all smaller primes (=A024934(p)).
%C A143851 Also, primes p such that p divides A024924(p). The prime terms of A065132.
%e A143851 13 is congruent to 1,1,3,6 and 2, modulo 2,3,5,7 and 11 respectively. 1+1+3+6+2=13, which is a multiple of the original number, 13. So the original number, is in the sequence.
%t A143851 For[n = 1, n < 1000001, n++, p = Prime[n]; m = Mod[Sum[Mod[p, Prime[i]], {i, 1, n - 1}], p]; If[m == 0, Print[p]]]
%Y A143851 Cf. A065132
%K A143851 more,nonn
%O A143851 1,1
%A A143851 _Neil Fernandez_, Sep 03 2008
%E A143851 a(6)-a(8) from _Max Alekseyev_, Feb 10 2012