login

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”).

A053814
a(n) = n modulo (sum of proper divisors of n).
2
0, 0, 1, 0, 0, 0, 1, 1, 2, 0, 12, 0, 4, 6, 1, 0, 18, 0, 20, 10, 8, 0, 24, 1, 10, 1, 0, 0, 30, 0, 1, 3, 14, 9, 36, 0, 16, 5, 40, 0, 42, 0, 4, 12, 20, 0, 48, 1, 7, 9, 6, 0, 54, 4, 56, 11, 26, 0, 60, 0, 28, 22, 1, 8, 66, 0, 10, 15, 70, 0, 72, 0, 34, 26, 12, 1, 78, 0, 80
OFFSET
2,9
LINKS
MATHEMATICA
Table[Mod[n, DivisorSigma[1, n]-n], {n, 2, 80}] (* Harvey P. Dale, Sep 01 2014 *)
PROG
(PARI) a(n) = n % (sigma(n) - n) \\ Michel Marcus, Jul 27 2013
CROSSREFS
Cf. A001065.
Sequence in context: A364375 A075533 A355783 * A293260 A095238 A167345
KEYWORD
nonn
AUTHOR
Henry Bottomley, Mar 28 2000
STATUS
approved