login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A182227
Sum of divisors of the abundant number m = A005101(n) which are smaller than its abundance A033880(m).
1
6, 3, 1, 24, 27, 55, 20, 19, 76, 21, 14, 108, 23, 3, 123, 12, 66, 140, 3, 144, 156, 22, 12, 1, 172, 52, 12, 240, 123, 204, 12, 126, 259, 147, 236, 138, 66, 312, 12, 42, 546, 12, 316, 7, 171, 165, 198, 44, 366, 384, 174, 12, 112, 218, 117, 744, 12, 476, 12, 198
OFFSET
1,1
COMMENTS
Motivated by A100696. See also A182225 and A182226.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from M. F. Hasler)
MATHEMATICA
f[n_] := If[(ab = DivisorSigma[1, n] - 2*n) > 0 , DivisorSum[n, # &, # < ab &], Nothing]; Array[f, 300] (* Amiram Eldar, Apr 06 2024 *)
PROG
(PARI) f(n)=my(A=sigma(n)-2*n, s); fordiv(n, d, (d<A && s+=d) || break); s
for(n=1, 500, sigma(n)>2*n & print1(f(n)", "))
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Apr 19 2012
STATUS
approved