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 A348521 #9 Oct 22 2021 16:15:00
%S A348521 3600,5040,6480,7056,7920,9072,9360,11088,11520,12240,13680,14400,
%T A348521 16128,16560,18000,20880,22320,25200,32400,35280,39600,44100,45360,
%U A348521 46800,55440,56700,57600,58320,58800,61200,63504,65520,68400,69300,71280,75600,77616,79380,80640
%N A348521 Numbers k such that A348271(k) > 2*k.
%C A348521 Odd terms exist (e.g., 349476304574870948475). What is the smallest odd term?
%H A348521 Amiram Eldar, <a href="/A348521/b348521.txt">Table of n, a(n) for n = 1..10000</a>
%e A348521 3600 is a term since the sum of the noninfinitary divisors of 3600 is A348271(3600) = 8073 > 2*3600 = 7200.
%t A348521 f[p_, e_] := Module[{b = IntegerDigits[e, 2], m}, m = Length[b]; Product[If[b[[j]] > 0, 1 + p^(2^(m - j)), 1], {j, 1, m}]]; isigma[1] = 1; isigma[n_] := Times @@ f @@@ FactorInteger[n]; s[n_] := DivisorSigma[1,n] - isigma[n]; Select[Range[10^5], s[#] > 2*# &]
%Y A348521 Cf. A348271, A348274.
%Y A348521 Similar sequence: A063846.
%K A348521 nonn
%O A348521 1,1
%A A348521 _Amiram Eldar_, Oct 21 2021