reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
seq = {}; smax = 0; Do[s = DivisorSigma[1, n]; If[s > smax, smax = s; If[PrimeQ[n + 1], AppendTo[seq, n + 1]]], {n, 1, 10^4}]; seq (* Amiram Eldar, Jun 07 2019 *)
Amiram Eldar, <a href="/A181561/b181561.txt">Table of n, a(n) for n = 1..1500</a>
approved
editing
_Jonathan Vos Post (jvospost3(AT)gmail.com), _, Jan 29 2011
reviewed
approved
proposed
reviewed
2, 3, 5, 7, 11, 13, 17, 19, 31, 37, 43, 61, 73, 97, 109, 181, 211, 241, 337, 421, 541, 601, 631, 661, 1009, 1201, 1621, 1801, 2161, 2341, 2521, 3121, 3361, 4201, 4621, 5881, 6121, 6301, 7561, 8821, 9241, 12241, 12601, 13441, 15121, 16381, 18481, 19801, 20161, 21841, 23761, 30241, 35281
allocated for Jonathan Vos PostPrimes of the form highly abundant number + 1.
2, 3, 5, 7, 11, 13, 17, 19, 31, 37, 43, 61, 73, 97, 109, 181, 211, 241, 337, 421, 541, 601, 631, 661, 1009, 1201, 1621, 1801
1,1
The 52nd highly abundant number is 1800, add one to get 1801 which is prime.
allocated
nonn,easy
Jonathan Vos Post (jvospost3(AT)gmail.com), Jan 29 2011
approved
proposed