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”).
%I #19 Apr 06 2024 07:54:06
%S 6,3,1,24,27,55,20,19,76,21,14,108,23,3,123,12,66,140,3,144,156,22,12,
%T 1,172,52,12,240,123,204,12,126,259,147,236,138,66,312,12,42,546,12,
%U 316,7,171,165,198,44,366,384,174,12,112,218,117,744,12,476,12,198
%N Sum of divisors of the abundant number m = A005101(n) which are smaller than its abundance A033880(m).
%C Motivated by A100696. See also A182225 and A182226.
%H Amiram Eldar, <a href="/A182227/b182227.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from M. F. Hasler)
%t f[n_] := If[(ab = DivisorSigma[1, n] - 2*n) > 0 ,DivisorSum[n, # &, # < ab &],Nothing]; Array[f, 300] (* _Amiram Eldar_, Apr 06 2024 *)
%o (PARI) f(n)=my(A=sigma(n)-2*n,s);fordiv(n,d,(d<A && s+=d) || break);s
%o for(n=1,500,sigma(n)>2*n & print1(f(n)","))
%Y Cf. A005101, A033880, A100696, A182225, A182226.
%K nonn
%O 1,1
%A _M. F. Hasler_, Apr 19 2012