A351198 Sum of the 10th powers of the primes dividing n.
0, 1024, 59049, 1024, 9765625, 60073, 282475249, 1024, 59049, 9766649, 25937424601, 60073, 137858491849, 282476273, 9824674, 1024, 2015993900449, 60073, 6131066257801, 9766649, 282534298, 25937425625, 41426511213649, 60073, 9765625, 137858492873, 59049, 282476273
Offset: 1
Keywords
Links
- Seiichi Manyama, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Mathematica
Array[DivisorSum[#, #^10 &, PrimeQ] &, 50] f[p_, e_] := p^10; a[n_] := Plus @@ f @@@ FactorInteger[n]; a[1] = 0; Array[a, 100] (* Amiram Eldar, Jun 20 2022 *)
-
PARI
a(n) = vecsum(apply(x->x^10, factor(n)[, 1])); \\ Michel Marcus, Feb 05 2022
-
Python
from sympy import primefactors def A351198(n): return sum(p**10 for p in primefactors(n)) # Chai Wah Wu, Feb 04 2022
Formula
a(n) = Sum_{p|n, p prime} p^10.
G.f.: Sum_{k>=1} prime(k)^10 * x^prime(k) / (1 - x^prime(k)). - Ilya Gutkovskiy, Feb 16 2022
Additive with a(p^e) = p^10. - Amiram Eldar, Jun 20 2022
a(n) = Sum_{d|n} d^10 * c(d), where c = A010051. - Wesley Ivan Hurt, Jun 22 2024
Comments