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 A357700 #9 Oct 12 2022 04:13:46
%S A357700 360360,471240,1801800,2356200,2522520,2633400,2784600,3112200,
%T A357700 3187800,3298680,3686760,3767400,3898440,3963960,4019400,4296600,
%U A357700 4462920,4684680,5128200,5183640,5682600,5793480,6126120,6846840,8011080,8288280,8953560,10210200,10450440
%N A357700 Noncubefree numbers k such that A073185(k) > 2*k.
%C A357700 The cubefree numbers k such that A073185(k) > 2*k are the cubefree abundant numbers (A357695).
%C A357700 The least odd term is (3/4) * prime(13)# * prime(197)# = 6.252...*10^517.
%H A357700 Amiram Eldar, <a href="/A357700/b357700.txt">Table of n, a(n) for n = 1..10000</a>
%e A357700 360360 = 2^3 * 45045 is a term since it is divisible by a cube and A073185(360360) = 733824 > 2*360360.
%t A357700 f[p_, e_] := 1 + p + If[e == 1, 0, p^2]; q[n_] := AnyTrue[(fct = FactorInteger[n])[[;;, 2]], # > 2 &] && Times @@ f @@@ fct > 2*n; Select[Range[2, 5*10^6], q]
%o A357700 (PARI) is(n) = {my(f = factor(n)); if(n == 1 || vecmax(f[,2]) < 3, return(0)); prod(i=1, #f~, 1 + f[i,1] + if(f[i,2]==1, 0, f[i,1]^2)) > 2*n};
%Y A357700 Cf. A073185, A357695.
%K A357700 nonn
%O A357700 1,1
%A A357700 _Amiram Eldar_, Oct 10 2022