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 A205098 #16 Feb 16 2025 08:33:16
%S A205098 16,21,22,36,42,55,50,54,76,66,64,108,78,74,123,90,106,140,92,144,156,
%T A205098 117,114,106,172,136,126,240,186,204,150,196,259,222,236,218,201,312,
%U A205098 186,196,366,198,316,203,270,265,300,226,366,384,284,234,280,332,312
%N A205098 Sum of proper divisors (A001065) of abundant numbers (A005101).
%H A205098 Amiram Eldar, <a href="/A205098/b205098.txt">Table of n, a(n) for n = 1..10000</a>
%H A205098 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AbundantNumber.html">Abundant Number</a>.
%H A205098 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RestrictedDivisorFunction.html">Restricted Divisor Function</a>.
%F A205098 a(n) = A001065(A005101(n)) = A204822(n) - A005101(n).
%t A205098 f[n_] := Module[{s = DivisorSigma[1, n] - n}, If[s > n, s, Nothing]]; Array[f, 250] (* _Amiram Eldar_, Mar 11 2024 *)
%Y A205098 Cf. A205099 (sum of proper divisors of deficient numbers), A204822 (sum of divisors of abundant numbers), A001065, A005101.
%K A205098 nonn
%O A205098 1,1
%A A205098 _Jaroslav Krizek_, Jan 22 2012