OFFSET
1,2
COMMENTS
a(p) = p for primes p.
FORMULA
a(n) = Sum_{d|n, gcd(d,n/d)=1} d * (ceiling(n/d^2)-floor(n/d^2)).
a(n) = A034448(n)-1. - Chai Wah Wu, Jun 20 2021
MATHEMATICA
a[n_] := -1 + Times @@ (1 + Power @@@ FactorInteger[n]); a[1] = 0; Array[a, 71] (* Amiram Eldar, Aug 31 2026 *)
PROG
(Python)
from math import prod
from sympy import factorint
def A345451(n): return prod(p**e+1 for p, e in factorint(n).items())-1 # Chai Wah Wu, Jun 20 2021
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
Wesley Ivan Hurt, Jun 19 2021
STATUS
approved