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 A342470 #25 Jan 20 2024 14:41:48 %S A342470 1,2,17,18,257,34,1297,274,1313,514,10001,306,20737,2594,4369,4370, %T A342470 65537,2626,104977,4626,22049,20002,234257,4658,160257,41474,106289, %U A342470 23346,614657,8738,810001,69906,170017,131074,333329,23634,1679617,209954,352529,70418 %N A342470 a(n) = Sum_{d|n} phi(d)^4. %H A342470 Seiichi Manyama, <a href="/A342470/b342470.txt">Table of n, a(n) for n = 1..10000</a> %F A342470 a(n) = Sum_{k=1..n} phi(n/gcd(k, n))^3. %F A342470 G.f.: Sum_{k>=1} phi(k)^4 * x^k/(1 - x^k). %F A342470 From _Amiram Eldar_, Nov 13 2022: (Start) %F A342470 Multiplicative with a(p^e) = 1 + ((p-1)^3*(p^(4*e)-1))/(p^3 + p^2 + p + 1). %F A342470 Sum_{k=1..n} a(k) ~ c * n^5, where c = (zeta(5)/5) * Product_{p prime} (1 - 4/p^2 + 6/p^3 - 4/p^4 + 1/p^5) = 0.05936545607... . (End) %t A342470 a[n_] := DivisorSum[n, EulerPhi[#]^4 &]; Array[a, 40] (* _Amiram Eldar_, Mar 13 2021 *) %o A342470 (PARI) a(n) = sumdiv(n, d, eulerphi(d)^4); %o A342470 (PARI) a(n) = sum(k=1, n, eulerphi(n/gcd(k, n))^3); %o A342470 (PARI) my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, eulerphi(k)^4*x^k/(1-x^k))) %Y A342470 Cf. A000010, A013663, A029939, A338997, A342471. %K A342470 nonn,mult %O A342470 1,2 %A A342470 _Seiichi Manyama_, Mar 13 2021