cp's OEIS Frontend

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.

A318679 Sum of abundancies of abundant divisors of n.

This page as a plain text file.
%I A318679 #7 Sep 05 2018 06:13:01
%S A318679 0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,3,0,2,0,0,0,16,0,0,0,0,0,12,0,0,0,
%T A318679 0,0,26,0,0,0,12,0,12,0,0,0,0,0,44,0,0,0,0,0,15,0,8,0,0,0,66,0,0,0,0,
%U A318679 0,12,0,0,0,4,0,89,0,0,0,0,0,12,0,38,0,0,0,72,0,0,0,4,0,69,0,0,0,0,0,104,0,0,0,19,0,12,0,2,0
%N A318679 Sum of abundancies of abundant divisors of n.
%H A318679 Antti Karttunen, <a href="/A318679/b318679.txt">Table of n, a(n) for n = 1..65537</a>
%H A318679 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A318679 a(n) = Sum_{d|n} [A033880(d) > 0]*A033880(d).
%F A318679 a(n) = A318678(n) - A296075(n).
%t A318679 f[n_] := DivisorSigma[1, n] - 2 n; Array[DivisorSum[#, f, f@ # >= 0 &] &, 105] (* _Michael De Vlieger_, Sep 04 2018 *)
%o A318679 (PARI) A318679(n) = sumdiv(n,d,d=sigma(d)-(2*d); (d>0)*d);
%Y A318679 Cf. A033880, A187795, A296075, A318441, A318442, A318678.
%K A318679 nonn
%O A318679 1,12
%A A318679 _Antti Karttunen_, Sep 04 2018