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 A374779 #6 Jul 19 2024 14:28:18
%S A374779 10886400,13305600,14515200,18144000,19958400,21772800,23587200,
%T A374779 23950080,24192000,25401600,26611200,27216000,29030400,29937600,
%U A374779 30481920,31449600,31933440,32659200,33264000,33868800,35380800,35925120,36288000,37739520,38102400,39312000,39916800
%N A374779 Numbers whose divisors have a mean abundancy index that is larger than 3.
%C A374779 Numbers k such that A374777(k)/A374778(k) > 3.
%C A374779 The numbers whose mean abundancy index of divisors is larger than 2 are in A245214.
%C A374779 The least odd term in this sequence is 84712751711029943302437712454902728115050897458369518458984375.
%H A374779 Amiram Eldar, <a href="/A374779/b374779.txt">Table of n, a(n) for n = 1..10000</a>
%e A374779 10886400 is a term since A374777(10886400)/A374778(10886400) = 70644571/23514624 = 3.004... > 3.
%t A374779 f[p_, e_] := ((e+1)*p^2 - (e+2)*p + p^(-e))/((e+1)*(p-1)^2); s[1] = 1; s[n_] := Times @@ f @@@ FactorInteger[n]; Select[Range[4*10^7], s[#] > 3 &]
%o A374779 (PARI) is(n) = {my(f = factor(n)); prod(i = 1, #f~, p=f[i,1]; e=f[i,2]; (-2*p - e*p + p^2 + e*p^2 + p^(-e))/((e + 1)*(p - 1)^2)) > 3;}
%Y A374779 Subsequence of A245214.
%Y A374779 Cf. A068403, A374777, A374778.
%K A374779 nonn
%O A374779 1,1
%A A374779 _Amiram Eldar_, Jul 19 2024