|
|
A054025
|
|
Sum of divisors of n read modulo (number of divisors of n).
|
|
11
|
|
|
0, 1, 0, 1, 0, 0, 0, 3, 1, 2, 0, 4, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 0, 4, 1, 2, 0, 2, 0, 0, 0, 3, 0, 2, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 4, 0, 3, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 3, 0, 2, 4, 2, 0, 0, 0, 6, 1, 2, 0, 8, 0, 0, 0, 4, 0, 6, 0, 0, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 2, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
with(numtheory): seq(sigma(i) mod tau(i), i=1..120);
|
|
MATHEMATICA
|
Table[Mod[DivisorSigma[1, n], DivisorSigma[0, n]], {n, 110}] (* Harvey P. Dale, Nov 16 2011 *)
|
|
PROG
|
(Haskell)
import Data.List (genericIndex)
a054025 n = genericIndex a054025_list (n-1)
a054025_list = zipWith mod a000203_list a000005_list
(PARI) vector(90, n, sigma(n) % numdiv(n)) \\ Michel Marcus, Aug 15 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|