A105825 a(n) = sigma(n) (mod 5).

1, 3, 4, 2, 1, 2, 3, 0, 3, 3, 2, 3, 4, 4, 4, 1, 3, 4, 0, 2, 2, 1, 4, 0, 1, 2, 0, 1, 0, 2, 2, 3, 3, 4, 3, 1, 3, 0, 1, 0, 2, 1, 4, 4, 3, 2, 3, 4, 2, 3, 2, 3, 4, 0, 2, 0, 0, 0, 0, 3, 2, 1, 4, 2, 4, 4, 3, 1, 1, 4, 2, 0, 4, 4, 4, 0, 1, 3, 0, 1, 1, 1, 4, 4, 3, 2, 0, 0, 0, 4, 2, 3, 3, 4, 0, 2, 3, 1, 1, 2, 2, 1, 4, 0, 2

Offset

1,2

Links

Antti Karttunen, Table of n, a(n) for n = 1..16384

Index entries for sequences related to sums of divisors

Maple

A105825:= n-> (numtheory[sigma](n) mod 5):
seq (A105825(n), n=1..105); # Jani Melik, Jan 26 2011

Mathematica

Mod[DivisorSigma[1, Range[110]], 5] (* Harvey P. Dale, Oct 03 2013 *)

Prog

(PARI) a(n)=sigma(n)%5

Crossrefs

Cf. A000203.

Sequences sigma(n) mod k: A053866 (k=2), A074941 (k=3), A105824 (k=4), A105825 (k=5), A084301 (k=6), A105826 (k=7), A105827 (k=8).

Sequence in context: A364871 A096392 A332964 * A238570 A145425 A201909

Adjacent sequences: A105822 A105823 A105824 * A105826 A105827 A105828

Keyword

easy,nonn

Author

Shyam Sunder Gupta, May 05 2005

Status

approved