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 A053192 #24 Dec 15 2023 06:18:59
%S A053192 0,4,9,32,25,144,49,256,243,600,121,1152,169,1568,1575,2048,289,3888,
%T A053192 361,4800,3969,5808,529,9216,3125,9464,6561,12544,841,19800,961,16384,
%U A053192 14157,20808,13475,31104,1369,28880,22815,38400,1681,52920,1849,46464
%N A053192 a(n) is the cototient of n^3.
%C A053192 For n^k, n^k - EulerPhi(n^k) = n^(k-1)*(n-EulerPhi(n)), or cototient(n^k) = n^(k-1)*cototient(n). A similar relation holds for Euler totient function.
%H A053192 Vincenzo Librandi, <a href="/A053192/b053192.txt">Table of n, a(n) for n = 1..1000</a>
%F A053192 a(n) = n^2*Cototient(n) = A051953(n^3) = n^3 - EulerPhi(n^3) = Cototient(n^3).
%F A053192 a(prime(n)) = A051953(prime(n)^3) = A001248(n).
%F A053192 Sum_{k=1..n} a(k) ~ c * n^4 / 4, where c = 1 - 6/Pi^2 (A229099). - _Amiram Eldar_, Dec 15 2023
%t A053192 Table[(n^3 - EulerPhi[n^3]), {n, 1, 50}] (* _Vincenzo Librandi_, Jul 27 2013 *)
%o A053192 (PARI) a(n) = n^3 - eulerphi(n^3) \\ _Michel Marcus_, Jul 26 2013
%o A053192 (Magma) [n^3-EulerPhi(n^3): n in [1..44]]; // _Vincenzo Librandi_, Jul 28 2013
%Y A053192 Cf. A000010, A051953, A002618, A053650, A053191, A001248, A229099.
%K A053192 nonn,easy
%O A053192 1,2
%A A053192 _Labos Elemer_, Mar 02 2000