A105826 a(n) = sigma(n) (mod 7).

1, 3, 4, 0, 6, 5, 1, 1, 6, 4, 5, 0, 0, 3, 3, 3, 4, 4, 6, 0, 4, 1, 3, 4, 3, 0, 5, 0, 2, 2, 4, 0, 6, 5, 6, 0, 3, 4, 0, 6, 0, 5, 2, 0, 1, 2, 6, 5, 1, 2, 2, 0, 5, 1, 2, 1, 3, 6, 4, 0, 6, 5, 6, 1, 0, 4, 5, 0, 5, 4, 2, 6, 4, 2, 5, 0, 5, 0, 3, 4, 2, 0, 0, 0, 3, 6, 1, 5, 6, 3, 0, 0, 2, 4, 1, 0, 0, 3, 2, 0, 4, 6, 6, 0, 3

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

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

Mathematica

Mod[DivisorSigma[1, Range[110]], 7] (* Harvey P. Dale, Jul 30 2021 *)

Prog

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

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: A158677 A337164 A105576 * A110665 A063441 A319600

Adjacent sequences: A105823 A105824 A105825 * A105827 A105828 A105829

Keyword

easy,nonn

Author

Shyam Sunder Gupta, May 05 2005

Status

approved