login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A332040
Number of integers whose exponential divisors sum to n.
5
1, 1, 1, 0, 1, 2, 1, 0, 0, 2, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 0, 0, 1, 5, 1, 0, 1, 2, 1, 0, 1, 1, 1, 0, 1, 2, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 3, 1, 1, 0, 0, 1, 3, 1, 0, 1, 2, 1, 1, 1, 1, 0, 0, 1, 3, 1, 0, 0, 1, 1, 1, 1, 1, 1
OFFSET
1,6
LINKS
EXAMPLE
a(6) = 2 since there are 2 solutions to esigma(x) = 6 (esigma is A051377): 4 and 6.
MATHEMATICA
f[p_, e_] := DivisorSum[e, p^# &]; esigma[1] = 1; esigma[n_] := Times @@ f @@@ FactorInteger[n]; m = 100; v = Table[0, {m}]; Do[e = esigma[k]; If[e <= m, v[[e]]++], {k, 1, m}]; v
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Feb 05 2020
STATUS
approved