OFFSET
1,2
COMMENTS
If p is prime, a(p) = Sum_{d|p} d^d * sopf(d) = 1^1*0 + p^p*p = p^(p+1).
Inverse Möbius transform of n^n * sopf(n). - Wesley Ivan Hurt, Mar 31 2025
LINKS
Robert Israel, Table of n, a(n) for n = 1..384
FORMULA
a(p^k) = p * Sum_{i=1..k} (p^i)^(p^i) for p prime and k >= 0. - Wesley Ivan Hurt, May 23 2026
EXAMPLE
a(4) = Sum_{d|4} d^d * sopf(d) = 1^1*sopf(1) + 2^2*sopf(2) + 4^4*sopf(4) = 0 + 8 + 512 = 520.
MAPLE
f:= proc(n) local d; add(d^d * convert(numtheory:-factorset(d), `+`), d=numtheory:-divisors(n)) end proc:
map(f, [$1..20]); # Robert Israel, Nov 25 2025
MATHEMATICA
Table[Sum[i^i*Sum[k (PrimePi[k] - PrimePi[k - 1]) (1 - Ceiling[i/k] + Floor[i/k]), {k, i}] (1 - Ceiling[n/i] + Floor[n/i]) , {i, n}], {n, 20}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, May 24 2021
STATUS
approved
