login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054024 Sum of divisors of n reduced modulo n. 18
0, 1, 1, 3, 1, 0, 1, 7, 4, 8, 1, 4, 1, 10, 9, 15, 1, 3, 1, 2, 11, 14, 1, 12, 6, 16, 13, 0, 1, 12, 1, 31, 15, 20, 13, 19, 1, 22, 17, 10, 1, 12, 1, 40, 33, 26, 1, 28, 8, 43, 21, 46, 1, 12, 17, 8, 23, 32, 1, 48, 1, 34, 41, 63, 19, 12, 1, 58, 27, 4, 1, 51, 1, 40, 49, 64, 19, 12, 1, 26, 40 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

Walter Nissen, Abundancy : Some Resources

FORMULA

a(n) = A000203(n) mod n

MAPLE

with(numtheory): seq(sigma(i) mod i, i=1..100);

PROG

(Haskell)

a054024 n = mod (a000203 n) n  -- Reinhard Zumkeller, Mar 23 2013

CROSSREFS

Cf. A000203, A045768, A045769, A088834, A045770, A076496.

Sequence in context: A055807 A213060 A205099 * A144644 A151509 A151511

Adjacent sequences:  A054021 A054022 A054023 * A054025 A054026 A054027

KEYWORD

nonn

AUTHOR

Asher Auel (asher.auel(AT)reed.edu) Jan 19, 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 23 08:25 EDT 2013. Contains 225585 sequences.