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 A369782 #11 Jul 16 2025 19:54:27
%S A369782 0,2,3,4,5,42,7,64,81,10010,11,288,13,7529550,50850,65536,17,34012548,
%T A369782 19,160400,85766562,26559922791446,23,663552,390625,95428956661682202,
%U A369782 387420489,481891088,29,656100810900,31,1099511627776,1531578985265538,3189059870763703892770850
%N A369782 a(n) = Sum_{p|n, p prime} n^phi(n/p).
%F A369782 a(p^k) = p^(k*(p-1)*p^(k-2)+floor(1/k)/p) for p prime and k>=1. - _Wesley Ivan Hurt_, Jul 16 2025
%t A369782 Table[DivisorSum[n, n^EulerPhi[n/#] &, PrimeQ[#] &], {n, 40}]
%Y A369782 Cf. A000010, A345893, A347104, A369687, A369779.
%K A369782 nonn,easy
%O A369782 1,2
%A A369782 _Wesley Ivan Hurt_, Jan 31 2024