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 A129498 #12 Feb 16 2025 08:33:05
%S A129498 12,12,12,4,12,12,12,12,12,12,12,156,12,12,12,12,12,12,204,12,12,228,
%T A129498 12,120,12,12,228,12,12,276,12,252,300,12,12,12,180,12,12,120,12,348,
%U A129498 300,12,12,12,188,120,12,324,12,12,48,300,420,12,12,196,72,444,12,372
%N A129498 Unitary abundancy of n-th unitary abundant number: usigma(k)-2k if this is > 0.
%C A129498 The transforms of this sequence are discussed in A129499.
%H A129498 Amiram Eldar, <a href="/A129498/b129498.txt">Table of n, a(n) for n = 1..10000</a>
%H A129498 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UnitaryDivisor.html">Unitary Divisor</a>.
%F A129498 A034448(k)-2k = A034460(k)-k, whenever these are positive.
%F A129498 a(n) = A129468(A034683(n)). - _Amiram Eldar_, Jun 18 2019
%e A129498 The fourth unitary abundant number is 70. As the unitary divisors of 70 are 1, 2, 5, 7, 10, 14, 35 and 70, we have a(4) = 1+2+5+7+10+14+35+70-2 * 70 = 4.
%t A129498 uab[1]=-1; uab[n_] := Times @@ (1 + Power @@@ FactorInteger[n]) - 2n; seq={}; Do[u=uab[n]; If[u>0, AppendTo[seq, u]], {n, 1, 1000}]; seq (* _Amiram Eldar_, Jun 18 2019 *)
%Y A129498 Cf. A034448, A034460, A129468, A034683, A129499.
%K A129498 easy,nonn
%O A129498 1,1
%A A129498 _Ant King_, Apr 20 2007