This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A239876 Partial sums of A229110, where A229110(n) = antisigma(n) mod n = A024816(n) mod n. 2
 0, 0, 2, 5, 9, 12, 18, 23, 28, 35, 45, 47, 59, 70, 76, 85, 101, 107, 125, 133, 143, 162, 184, 184, 203, 226, 240, 254, 282, 285, 315, 332, 350, 381, 403, 438, 474, 509, 531, 541, 581, 590, 632, 658, 670, 713, 759, 803, 844, 876, 906, 938, 990, 1005, 1043, 1063 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Antisigma(n) = A024816(n) = sum of non-divisors of n. See A239877 - values of n for which a(n) / n is integer. LINKS Jaroslav Krizek, Table of n, a(n) for n = 1..1000 FORMULA a(n) = Sum_{k = 1...n} antisigma(k) mod k = Sum_{k = 1...n} A229110(k). a(n) = a(n-1) for numbers n from A159907 if there are no odd multiply perfect numbers (A007691). PROG (MAGMA)[&+[(k*(k+1)div 2 - SumOfDivisors (k)) mod k: k in [1..n]]: n in [1..1000]] CROSSREFS Cf. A024816, A229110, A239877. Sequence in context: A034806 A226822 A034307 * A070828 A112988 A218706 Adjacent sequences:  A239873 A239874 A239875 * A239877 A239878 A239879 KEYWORD nonn AUTHOR Jaroslav Krizek, Mar 29 2014 STATUS approved

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

Last modified December 16 20:08 EST 2018. Contains 318188 sequences. (Running on oeis4.)