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 A335325 #16 Jul 07 2022 06:43:16
%S A335325 2,3,5,7,11,17,19,29,41,71,109,181,379,449,701,881,1429,1871,2729,
%T A335325 3079,4159,5851,11969,22679,23561,23869,40699,65449,90271,104651,
%U A335325 188189,226799,244529,252449,388961,403649,815671,825551,1276001,2380951,2408561
%N A335325 Primes p such that d(p^2-1) sets a record, where d(n) is the number of divisors of n.
%H A335325 Amiram Eldar, <a href="/A335325/b335325.txt">Table of n, a(n) for n = 1..64</a>
%e A335325 7^2-1 = 48 has 10 factors, which is the largest for any prime <= 7 (5^2-1 has 8 factors, 3^2-1 has 4 factors, and 2^2-1 has 2 factors).
%t A335325 seq[len_] := Module[{s = {}, p = 2, dm = 0, c = 0, d}, While[c < len, If[(d = DivisorSigma[0, p^2 - 1]) > dm, dm = d; c++; AppendTo[s, p]]; p = NextPrime[p]]; s]; seq[30] (* _Amiram Eldar_, Jul 07 2022 *)
%o A335325 (PARI) my(r=0,d);forprime(p=2,3*10^6,if((d=numdiv(p^2-1))>r,r=d;print1(p,", "))); \\ _Joerg Arndt_, Jun 01 2020
%Y A335325 Cf. A000005, A341655.
%K A335325 nonn
%O A335325 1,1
%A A335325 _Austin Nguyen Tran_, May 31 2020