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 A319341 #18 Dec 21 2023 10:23:02 %S A319341 0,0,0,1,0,0,0,3,4,0,0,2,0,0,0,7,0,4,0,4,0,0,0,6,16,0,16,6,0,0,0,15,0, %T A319341 0,0,10,0,0,0,12,0,0,0,10,16,0,0,14,36,16,0,12,0,16,0,18,0,0,0,8,0,0, %U A319341 24,31,0,0,0,16,0,0,0,22,0,0,32,18,0,0,0,28,52,0,0,12,0,0,0,30,0,16,0,22,0,0,0,30,0,36,40,36,0,0,0,36,0 %N A319341 a(n) = A000010(n) - A173557(n). %H A319341 Antti Karttunen, <a href="/A319341/b319341.txt">Table of n, a(n) for n = 1..65537</a> %F A319341 a(n) = A000010(n) - A173557(n). %F A319341 a(n) = A318841(n) - A051953(n). %F A319341 a(A005117(n)) = 0. - _Ivan N. Ianakiev_, Sep 18 2018 %F A319341 Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = A059956 - A307868 = 0.136246... . - _Amiram Eldar_, Dec 21 2023 %t A319341 a[n_] := EulerPhi[n] - Times @@ (FactorInteger[n][[;;, 1]] - 1); a[1] = 0; Array[a, 100] (* _Amiram Eldar_, Dec 21 2023 *) %o A319341 (PARI) %o A319341 A173557(n) = factorback(apply(p -> p-1, factor(n)[, 1])); %o A319341 A319341(n) = (eulerphi(n)-A173557(n)); %Y A319341 Cf. A000010, A051953, A173557, A318841, A319340, A126864. %Y A319341 Cf. A013661, A307868. %K A319341 nonn,easy %O A319341 1,8 %A A319341 _Antti Karttunen_, Sep 17 2018