The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A058344 Difference between the sum of the odd aliquot divisors of n and the sum of the even aliquot divisors of n. 3
 0, 1, 1, -1, 1, 2, 1, -5, 4, 4, 1, -8, 1, 6, 9, -13, 1, 5, 1, -10, 11, 10, 1, -28, 6, 12, 13, -12, 1, 6, 1, -29, 15, 16, 13, -29, 1, 18, 17, -38, 1, 10, 1, -16, 33, 22, 1, -68, 8, 19, 21, -18, 1, 14, 17, -48, 23, 28, 1, -60, 1, 30, 41, -61, 19, 18, 1, -22, 27, 22, 1, -97, 1, 36, 49, -24, 19, 22, 1, -94, 40 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS The number of terms where the sum of the odd parts is greater than the sum of the even parts up to 10^n: 6, 57, 521, 5070, 50223, 500707, 5002236, ... LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA G.f.: Sum_{k>0} -(-1)^k * k * x^(2*k) / (1 - x^k). - Michael Somos, Aug 21 2005 EXAMPLE a(28) = -12 because the sum of the even divisors of 28 (2, 4 and 14) = 20 and the sum of the odd divisors of 28 (1 and 7) = 8. G.f. = x^2 + x^3 - x^4 + x^5 + 2*x6 + x^7 - 5*x^8 + 4*x^9 + 4*x^10 + x^11 + ... MATHEMATICA f[n_Integer] := Block[{d = Most[Divisors[n]]}, Plus @@ (-d*(-1)^d)]; Table[ f[n], {n, 81}] (* or *) Rest[ CoefficientList[ Series[ Sum[ -(-1)^k*k*x^(2k)/(1 - x^k), {k, 100}], {x, 0, 81}], x]] (* Robert G. Wilson v, Aug 26 2005 *) Table[With[{d=Most[Divisors[n]]}, Total[Select[d, OddQ]]-Total[Select[d, EvenQ]]], {n, 90}] (* Harvey P. Dale, Feb 16 2013 *) PROG (PARI) {a(n) = if(n<1, 0, sumdiv(n, d, (d

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 3 15:26 EDT 2023. Contains 365867 sequences. (Running on oeis4.)