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 A369908 #6 Jun 26 2024 15:21:46
%S A369908 0,1,1,4,1,12,1,64,9,20,1,288,1,28,30,4096,1,648,1,800,42,44,1,27648,
%T A369908 25,52,729,1568,1,2700,1,1048576,66,68,70,93312,1,76,78,128000,1,5292,
%U A369908 1,3872,4050,92,1,10616832,49,5000,102,5408,1,314928,110,351232,114
%N A369908 a(n) = Sum_{p|n, p prime} n^Omega(n/p).
%F A369908 a(p^k) = p^(k*(k-1)), for p prime and k >= 1. - _Wesley Ivan Hurt_, Jun 26 2024
%t A369908 Table[DivisorSum[n, n^PrimeOmega[n/#] &, PrimeQ[#] &], {n, 100}]
%Y A369908 Cf. A001222 (Omega), A369741.
%K A369908 nonn,easy
%O A369908 1,4
%A A369908 _Wesley Ivan Hurt_, Feb 05 2024