login
A353776
a(n) = Sum_{d|n} (n/d mod d).
1
0, 1, 1, 1, 1, 4, 1, 3, 1, 4, 1, 7, 1, 4, 6, 3, 1, 7, 1, 8, 5, 4, 1, 14, 1, 4, 4, 10, 1, 14, 1, 7, 6, 4, 8, 11, 1, 4, 5, 17, 1, 16, 1, 10, 13, 4, 1, 19, 1, 9, 6, 8, 1, 16, 7, 17, 5, 4, 1, 32, 1, 4, 13, 7, 9, 19, 1, 8, 6, 23, 1, 27, 1, 4, 10, 10, 12, 16, 1, 23
OFFSET
1,6
LINKS
MATHEMATICA
a[n_] := DivisorSum[n, Mod[n/#, #] &]; Array[a, 100] (* Amiram Eldar, May 07 2022 *)
PROG
(Haskell)
import Math.NumberTheory.ArithmeticFunctions
a n = sum $ map (\d -> n `quot` d `rem` d) $ divisorsList n
(PARI) A353776(n) = sumdiv(n, d, ((n/d)%d)); \\ Antti Karttunen, May 08 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Sebastian Karlsson, May 07 2022
STATUS
approved