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 A347146 #45 Mar 31 2025 14:08:36
%S A347146 0,4,27,1028,3125,233311,823543,201327620,2324522961,70000003129,
%T A347146 285311670611,142657607406431,302875106592253,100008061430845691,
%U A347146 3503151123046878152,590295810358906979332,827240261886336764177,826274569581229613840149,1978419655660313589123979
%N A347146 a(n) = Sum_{d|n} (d^d)', where ' is the arithmetic derivative.
%C A347146 Inverse Möbius transform of (n^n)'. - _Wesley Ivan Hurt_, Mar 31 2025
%H A347146 Michael De Vlieger, <a href="/A347146/b347146.txt">Table of n, a(n) for n = 1..385</a>
%F A347146 a(n) = Sum_{d|n} A068327(d). - _R. J. Mathar_, Oct 19 2021
%e A347146 a(4) = (1^1)' + (2^2)' + (4^4)' = 1' + 4' + 256' = 0 + 4 + 1024 = 1028.
%p A347146 A347146 := proc(n)
%p A347146 add(A068327(d),d=numtheory[divisors](n)) ;
%p A347146 end proc:
%p A347146 seq( A347146(n),n=1..10) ; # _R. J. Mathar_, Oct 19 2021
%t A347146 d[0] = d[1] = 0; d[n_] := n * Plus @@ ((Last[#]/First[#]) & /@ FactorInteger[n]); a[n_] := DivisorSum[n, d[#^#] &]; Array[a, 20] (* _Amiram Eldar_, Oct 16 2021 *)
%o A347146 (PARI) ad(n) = vecsum([n/f[1]*f[2]|f<-factor(n+!n)~]); \\ A003415
%o A347146 a(n) = sumdiv(n, d, ad(d^d)); \\ _Michel Marcus_, Oct 18 2021
%Y A347146 Cf. A003415, A068327.
%K A347146 nonn
%O A347146 1,2
%A A347146 _Wesley Ivan Hurt_, Oct 16 2021