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 A164319 #8 Sep 14 2017 04:12:43
%S A164319 3,5,7,11,17,19,23,29,31,41,47,53,59,71,79,83,89,101,103,107,113,127,
%T A164319 131,137,139,149,167,173,179,191,197,199,223,227,233,239,251,257,263,
%U A164319 269,271,281,293,307,311,317,347,349,353,359,367,379,383,389,401,419
%N A164319 Primes p such that the sum of divisors of p+1 is larger than 2*p.
%C A164319 For a subset of these, namely p=179, 239, 359, 419, etc, sigma(p+1) is even larger than 3*p.
%H A164319 G. C. Greubel, <a href="/A164319/b164319.txt">Table of n, a(n) for n = 1..5000</a>
%e A164319 For p=3, the sum of divisors of p+1 is A000203(4)=7 > 2*3, so p=3 is in the sequence.
%t A164319 f[n_]:=Plus@@Divisors[n]; lst={};Do[p=Prime[n];If[f[p+1]>2*p,AppendTo[lst, p]],{n,6!}];lst
%t A164319 Select[Prime[Range[100]], DivisorSigma[1, # + 1] > 2 # &] (* _G. C. Greubel_, Sep 13 2017 *)
%o A164319 (PARI) lista(nn) = forprime(p=2, nn, if (sigma(p+1) > 2*p, print1(p, ", "))); \\ _Michel Marcus_, Sep 13 2017
%Y A164319 Cf. A008333, A085498, A164318.
%K A164319 nonn
%O A164319 1,1
%A A164319 _Vladimir Joseph Stephan Orlovsky_, Aug 12 2009
%E A164319 Edited by _R. J. Mathar_, Aug 21 2009