This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A351195 #19 Jun 22 2024 18:35:11
%S A351195 0,128,2187,128,78125,2315,823543,128,2187,78253,19487171,2315,
%T A351195 62748517,823671,80312,128,410338673,2315,893871739,78253,825730,
%U A351195 19487299,3404825447,2315,78125,62748645,2187,823671,17249876309,80440,27512614111,128,19489358,410338801
%N A351195 Sum of the 7th powers of the primes dividing n.
%C A351195 Inverse Möbius transform of n^7 * c(n), where c(n) is the prime characteristic (A010051). - _Wesley Ivan Hurt_, Jun 22 2024
%H A351195 Seiichi Manyama, <a href="/A351195/b351195.txt">Table of n, a(n) for n = 1..10000</a>
%F A351195 a(n) = Sum_{p|n, p prime} p^7.
%F A351195 G.f.: Sum_{k>=1} prime(k)^7 * x^prime(k) / (1 - x^prime(k)). - _Ilya Gutkovskiy_, Feb 16 2022
%F A351195 Additive with a(p^e) = p^7. - _Amiram Eldar_, Jun 20 2022
%F A351195 a(n) = Sum_{d|n} d^7 * c(d), where c = A010051. - _Wesley Ivan Hurt_, Jun 22 2024
%t A351195 Array[DivisorSum[#, #^7 &, PrimeQ] &, 50]
%t A351195 f[p_, e_] := p^7; a[n_] := Plus @@ f @@@ FactorInteger[n]; a[1] = 0; Array[a, 100] (* _Amiram Eldar_, Jun 20 2022 *)
%Y A351195 Sum of the k-th powers of the primes dividing n for k=0..10 : A001221 (k=0), A008472 (k=1), A005063 (k=2), A005064 (k=3), A005065 (k=4), A351193 (k=5), A351194 (k=6), this sequence (k=7), A351196 (k=8), A351197 (k=9), A351198 (k=10).
%Y A351195 Cf. A010051.
%K A351195 nonn
%O A351195 1,2
%A A351195 _Wesley Ivan Hurt_, Feb 04 2022