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 A070236 #29 Jun 15 2021 01:29:29
%S A070236 0,1,2,1,2,6,7,5,0,6,7,6,7,15,22,15,16,12,13,10,19,31,32,30,11,25,10,
%T A070236 5,6,28,29,15,28,46,57,46,47,67,82,76,77,107,108,99,80,104,105,92,51,
%U A070236 33,52,41,42,30,45,35,56,86,87,86,87,119,90,59,76,122,123,108,133,179,180
%N A070236 a(n) = Sum_{k=1..n} (core(k) - phi(k)), where core(k) is the squarefree part of k.
%C A070236 a(n) is always >= 0.
%H A070236 Amiram Eldar, <a href="/A070236/b070236.txt">Table of n, a(n) for n = 1..10000</a>
%H A070236 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SquarefreePart.html">Squarefree Part</a>.
%H A070236 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TotientFunction.html">Totient Function</a>.
%F A070236 a(n) = A069891(n) - A002088(n) = Sum_{k=1..n} (A007913(k) - A000010(k)).
%F A070236 Asymptotically: a(n) = (Pi^2/30 - 3/Pi^2)*n^2 + O(n*log(n)).
%t A070236 f[n_] := Times @@ (First[#]^Mod[Last[#], 2] & /@ FactorInteger[n]) - EulerPhi[n]; Accumulate @ Array[f, 100] (* _Amiram Eldar_, Sep 06 2020 *)
%o A070236 (PARI) for(n=1,100,print1(sum(i=1,n,core(i)-eulerphi(i)),","))
%Y A070236 Cf. A000010, A002088, A007913, A069891.
%K A070236 easy,nonn
%O A070236 1,3
%A A070236 _Benoit Cloitre_, May 08 2002
%E A070236 Various sections edited by _Petros Hadjicostas_, May 11 2020