Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Sep 11 2019 17:59:30
%S 3,5,11,29,59,179,239,419,1319,3119,3359,7559,21839,35279,42839,55439,
%T 110879,415799,1713599,1867319,1912679,1940399,2489759,3991679,
%U 6652799,6846839,11531519,28828799,85765679,232792559,845404559,1470268799,6285399119,6299092799
%N Lesser of twin primes p for which sigma(p+1)/sigma(p) reaches record value, where sigma(n) is the divisor sum function (A000203).
%C Garcia et al. proved that assuming Dickson's conjecture, {sigma(p+1)/sigma(p) : p and p+2 are prime} is dense in [2, oo), and thus this sequence is infinite.
%H Stephan Ramon Garcia, Florian Luca, Kye Shi, Gabe Udell, <a href="https://arxiv.org/abs/1906.05927">Primitive root bias for twin primes II: Schinzel-type theorems for totient quotients and the sum-of-divisors function</a>, arXiv:1906.05927 [math.NT], 2019.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Dickson%27s_conjecture">Dickson's conjecture</a>.
%e The values of sigma(p+1)/sigma(p) for the first terms are 1.75 < 2 < 2.333 < 2.4 < 2.8 < ...
%t s = {}; rm = 0; p = 2; Do[q = NextPrime[p]; If[q - p != 2, p = q; Continue[]]; r = DivisorSigma[1, p + 1]/DivisorSigma[1, p]; If[r > rm, rm = r; AppendTo[s, p]]; p = q, {10^3}]; s
%Y Cf. A000203, A001359, A006512, A008333.
%K nonn
%O 1,1
%A _Amiram Eldar_, Sep 11 2019