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 A065512 #20 Sep 08 2022 08:45:04
%S A065512 1,3,5,6,10,11,12,17,20,22,24,26,27,29,30,38,41,42,45,46,51,55,59,62,
%T A065512 68,69,71,77,82,85,88,91,99,101,104,105,106,107,108,114,116,118,125,
%U A065512 126,132,135,136,137,140,141,145,146,147,149,150,155,158,160,161
%N A065512 Numbers n such that sigma(n) + 1 is prime.
%H A065512 Harry J. Smith, <a href="/A065512/b065512.txt">Table of n, a(n) for n=1..1000</a>
%H A065512 OEIS Wiki, <a href="https://oeis.org/wiki/Cyclotomic Polynomials at x=n, n! and sigma(n)">Cyclotomic Polynomials at x=n, n! and sigma(n)</a>
%e A065512 sigma(10) + 1 = 18 + 1 = 19 (prime). sigma(24) + 1 = 60 + 1 = 61 (prime).
%p A065512 select(isprime @ (1+numtheory:-sigma), [$1..1000]); # _Robert Israel_, May 29 2015
%t A065512 Select[ Range[170], PrimeQ[ DivisorSigma[1, # ] + 1] & ]
%o A065512 (PARI) { n=0; for (m=1, 10^9, if (isprime(sigma(m) + 1), write("b065512.txt", n++, " ", m); if (n==1000, return)) ) } \\ _Harry J. Smith_, Oct 20 2009
%o A065512 (Magma) [n: n in [1..200] | IsPrime(1+SumOfDivisors(n))]; // _Vincenzo Librandi_, May 30 2015
%Y A065512 Cf. A000203, A088580, A258430.
%K A065512 nonn
%O A065512 1,2
%A A065512 _Joseph L. Pe_, Nov 26 2001