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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,9

LINKS

Antti Karttunen, Table of n, a(n) for n = 2..16385

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: A102869 A274177 A075533 * A293260 A095238 A167345

Adjacent sequences:  A053811 A053812 A053813 * A053815 A053816 A053817

KEYWORD

nonn

AUTHOR

Henry Bottomley, Mar 28 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 31 13:01 EDT 2020. Contains 334748 sequences. (Running on oeis4.)