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 A357607 #11 Oct 09 2022 04:22:46
%S A357607 4725,6615,7875,8505,11025,14175,15435,17325,19845,20475,22275,23625,
%T A357607 24255,25515,26775,28665,29925,31185,33075,36225,36855,37125,37485,
%U A357607 38115,39375,40425,41895,42525,46305,47775,48195,50715,51975,53235,53865,55125,57915,59535
%N A357607 Odd numbers k such that A162296(k) > 2*k.
%C A357607 The least term that is not divisible by 3 is a(89047132) = 134785275625.
%C A357607 The numbers of terms not exceeding 10^k, for k = 4, 5, ..., are 4, 60, 640, 6650, 66044, 660230, 6604594, 66073470, ... . Apparently, the asymptotic density of this sequence exists and equals 0.000660... .
%H A357607 Amiram Eldar, <a href="/A357607/b357607.txt">Table of n, a(n) for n = 1..10000</a>
%e A357607 4725 is a term since it is odd, and A162296(4725) = 9728 > 2*4725.
%t A357607 q[n_] := Module[{f = FactorInteger[n], p, e}, p = f[[;; , 1]]; e = f[[;; , 2]]; Times @@ ((p^(e + 1) - 1)/(p - 1)) - Times @@ (p + 1) > 2*n]; Select[Range[3, 60000, 2], q]
%Y A357607 Cf. A162296.
%Y A357607 Subsequence of A005231, A013929 and A357605.
%Y A357607 Similar sequences: A094889, A127666, A129485, A293186, A321147, A348275, A348605.
%K A357607 nonn
%O A357607 1,1
%A A357607 _Amiram Eldar_, Oct 06 2022