The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A294885 a(n) = A004125(n) mod n = [Sum_{i=1..n} (n mod i)] mod n. 1
 0, 0, 1, 1, 4, 3, 1, 0, 3, 3, 0, 5, 2, 3, 6, 4, 0, 11, 7, 1, 7, 11, 6, 13, 3, 8, 17, 12, 6, 18, 12, 7, 19, 27, 8, 18, 11, 20, 35, 18, 10, 32, 24, 20, 24, 36, 27, 38, 22, 20, 41, 38, 28, 6, 34, 16, 40, 56, 45, 46, 35, 52, 0, 53, 23, 65, 53, 51, 12, 65, 52, 60, 47, 68, 6, 4, 48, 22, 7, 46, 73, 15, 82, 11, 58, 83, 35, 15, 87, 17, 71, 71 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA a(n) = [Sum_{i=1..n} (n mod i)] mod n. PROG (PARI) A294885(n) = (sum(k=2, n, n%k)%n); CROSSREFS Cf. A004125. Cf. A056550 (positions of zeros). Sequence in context: A131027 A133475 A242106 * A021236 A136590 A117026 Adjacent sequences:  A294882 A294883 A294884 * A294886 A294887 A294888 KEYWORD nonn AUTHOR Antti Karttunen, Nov 13 2017 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 January 26 11:20 EST 2020. Contains 331279 sequences. (Running on oeis4.)