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 A326393 #12 Apr 19 2023 09:05:14
%S A326393 2,3,5,11,23,47,59,167,179,239,359,719,839,1259,3359,5039,10079,35279,
%T A326393 37799,55439,110879,166319,665279,831599,1081079,1441439,6320159,
%U A326393 6486479,12972959,24504479,61261199,82162079,136936799,232792559,410810399,698377679,735134399
%N A326393 Primes p for which sigma(p+1)/sigma(p) reaches a record value, where sigma(k) is the divisor sum function (A000203).
%C A326393 Garcia et al. proved that {sigma(p+1)/sigma(p) : p prime} is dense in [3/2, oo), and thus this sequence is infinite.
%H A326393 Stephan Ramon Garcia, Florian Luca, Kye Shi, and 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.
%e A326393 The values of sigma(p+1)/sigma(p) for the first terms are 1.333... < 1.75 < 2 < 2.333... < 2.5 < ...
%t A326393 s = {}; rm = 0; p = 2; Do[q = NextPrime[p]; r = DivisorSigma[1, p + 1]/DivisorSigma[1, p]; If[r > rm, rm = r; AppendTo[s, p]]; p = q, {10^3}]; s
%Y A326393 Cf. A000203, A008333.
%K A326393 nonn
%O A326393 1,1
%A A326393 _Amiram Eldar_, Sep 11 2019