login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126164 Sum of the proper exponential divisors of n. 15
0, 0, 0, 2, 0, 0, 0, 2, 3, 0, 0, 6, 0, 0, 0, 6, 0, 6, 0, 10, 0, 0, 0, 6, 5, 0, 3, 14, 0, 0, 0, 2, 0, 0, 0, 36, 0, 0, 0, 10, 0, 0, 0, 22, 15, 0, 0, 18, 7, 10, 0, 26, 0, 6, 0, 14, 0, 0, 0, 30, 0, 0, 21, 14, 0, 0, 0, 34, 0, 0, 0, 48, 0, 0, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
The e-divisors (or exponential divisors) of x=Product p(i)^r(i) are all numbers of the form Product p(i)^s(i) where s(i) divides r(i) for all i.
LINKS
Eric Weisstein's World of Mathematics, e-Divisor.
FORMULA
a(n) = esigma(n) - n = A051377(n) - n.
EXAMPLE
The exponential divisors of 240 are 30, 60 and 240, so a(240) = 30+60 = 90.
MATHEMATICA
f[p_, e_] := DivisorSum[e, p^# &]; a[1] = 0; a[n_] := Times @@ f @@@ FactorInteger[n] - n; Array[a, 100] (* Amiram Eldar, Aug 13 2023 *)
PROG
(PARI)
A051377(n) = { my(f=factor(n)); prod(i=1, #f[, 1], sumdiv(f[i, 2], d, f[i, 1]^d)); }; \\ This function from Charles R Greathouse IV, Nov 22 2011
A126164(n) = (A051377(n) - n); \\ Antti Karttunen, Oct 04 2017, after the given formula
CROSSREFS
Sequence in context: A349435 A063958 A349434 * A340317 A145007 A308376
KEYWORD
easy,nonn
AUTHOR
Ant King, Dec 21 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 09:18 EDT 2024. Contains 371935 sequences. (Running on oeis4.)