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 A326313 #18 Sep 12 2019 11:49:09
%S A326313 3,9,21,63,189,441,567,693,2079,4851,6237,13167,39501,92169,118503,
%T A326313 276507,829521,908523,2119887,2725569,6359661,19078983,28164213,
%U A326313 57236949,84492639,171710847,197149491,591448473,1211061159,1774345419,3633183477,5323036257,6505933203
%N A326313 Where the number of divisors d(k) reaches a new record for numbers k whose prime factors are of the form 4*j+3.
%C A326313 For references and links see A326312.
%H A326313 Amiram Eldar, <a href="/A326313/b326313.txt">Table of n, a(n) for n = 1..300</a>
%t A326313 aQ[n_] := AllTrue[FactorInteger[n][[;; , 1]], Mod[#, 4] == 3 &]; s[n_] := DivisorSum[n, 1 &, aQ[#] &]; sm = 0; seq = {}; Do[s1 = s[n]; If[s1 > sm, sm = s1; AppendTo[seq, n]], {n, 2, 10^5}]; seq (* _Amiram Eldar_, Sep 12 2019 *)
%o A326313 (PARI) pkn(x,d,m)={my(fn=factor(x),nf=#fn[,1]);for(k=1,nf,if(fn[k,1]%d!=m,return(0)));numdiv(x)};
%o A326313 divrecord=0;
%o A326313 for(k=2,50000000,my(j=pkn(k,4,3));if(j>divrecord,divrecord=j;print1(k,", ")))
%Y A326313 Cf. A053624, A071383, A230655, A326312, A326314.
%K A326313 nonn
%O A326313 1,1
%A A326313 _Hugo Pfoertner_, Sep 11 2019
%E A326313 More terms from _Amiram Eldar_, Sep 12 2019