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 A129656 #18 Feb 16 2025 08:33:05
%S A129656 24,30,40,42,54,56,66,70,72,78,88,96,102,104,114,120,138,150,168,174,
%T A129656 186,210,216,222,246,258,264,270,280,282,294,312,318,330,354,360,366,
%U A129656 378,384,390,402,408,420,426,438,440,456,462,474,480,486,498
%N A129656 Infinitary abundant numbers: integers for which A126168 (n)>n, or equivalently for which A049417 (n)>2n.
%C A129656 For large n, the distribution of a(n) is approximately linear and asymptotically satisfies a(n)~7.95n. It follows that the density of the infinitary abundant numbers is 1/7.95, which is about 0.126.
%H A129656 Amiram Eldar, <a href="/A129656/b129656.txt">Table of n, a(n) for n = 1..10000</a>
%H A129656 Graeme L. Cohen, <a href="http://dx.doi.org/10.1090/S0025-5718-1990-0993927-5">On an integer's infinitary divisors</a>, Math. Comp., 54 (1990), 395-411.
%H A129656 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/InfinitaryDivisor.html">Infinitary Divisor</a>.
%e A129656 The third integer that is exceeded by its proper infinitary divisor sum is 40. Hence a(3)=40.
%t A129656 ExponentList[n_Integer,factors_List]:={#,IntegerExponent[n,# ]}&/@factors;InfinitaryDivisors[1]:={1}; InfinitaryDivisors[n_Integer?Positive]:=Module[ { factors=First/@FactorInteger[n], d=Divisors[n] }, d[[Flatten[Position[ Transpose[ Thread[Function[{f,g}, BitOr[f,g]==g][ #,Last[ # ]]]&/@ Transpose[Last/@ExponentList[ #,factors]&/@d]],_?(And@@#&),{1}]] ]] ] Null;properinfinitarydivisorsum[k_]:=Plus@@InfinitaryDivisors[k]-k;InfinitaryAbundantNumberQ[k_]:=If[properinfinitarydivisorsum[k]>k,True,False];Select[Range[500],InfinitaryAbundantNumberQ[ # ] &]
%t A129656 fun[p_, e_] := Module[{ b = IntegerDigits[e, 2]}, m=Length[b]; Product[If[b[[j]] > 0, 1+p^(2^(m-j)), 1], {j, 1, m}]]; isigma[1]=1; isigma[n_] := Times @@ fun @@@ FactorInteger[n]; Select[Range[1000], isigma[#]>2# &] (* _Amiram Eldar_, May 12 2019 *)
%Y A129656 Cf. A126168, A049417, A127666, A129657, A007357.
%K A129656 easy,nonn
%O A129656 1,1
%A A129656 _Ant King_, Apr 29 2007