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 A319214 #24 Dec 09 2024 05:28:44
%S A319214 6,22,120,280,1240,1120,5400,5280,12960,12880,45240,24752,90240,59160,
%T A319214 96000,141984,346880,163800,540000,326720,588984,585120,1523280,
%U A319214 582400,1728000,1203840,2294712,1758096,4692408,1388000,6480000,3787200,5416800,4783680,7440000
%N A319214 a(n) = phi(n^5 - 1)/5 where phi is A000010.
%H A319214 Seiichi Manyama, <a href="/A319214/b319214.txt">Table of n, a(n) for n = 2..1000</a>
%H A319214 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TotientFunction.html">Totient Function</a>.
%H A319214 Wikipedia, <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function">Euler's totient function</a>.
%F A319214 Sum_{k=1..n} a(k) = c * n^6 + O((n*log(n))^5), where c = (1/30) * Product_{p prime == 1 (mod 5)} (1 - 5/p^2) * Product_{p prime !== 1 (mod 5)} (1 - 1/p^2) = 0.019389107739... . - _Amiram Eldar_, Dec 09 2024
%t A319214 Table[EulerPhi[n^5-1]/5,{n,2,40}] (* _Harvey P. Dale_, Feb 09 2019 *)
%o A319214 (PARI) {a(n) = eulerphi(n^5-1)/5}
%Y A319214 Row 5 of A369291.
%Y A319214 Cf. A000010, A258807 (n^5-1).
%Y A319214 phi(n^b - 1)/b: A319210 (b=2), A319213 (b=3), this sequence (b=5).
%K A319214 nonn,easy
%O A319214 2,1
%A A319214 _Seiichi Manyama_, Sep 13 2018