cp's OEIS Frontend

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.

A055929 Euler totient function of the factorial of prime(n).

Original entry on oeis.org

1, 2, 32, 1152, 8294400, 1194393600, 64210599936000, 20804234379264000, 4229084764616785920000, 1396531754239566739931136000000, 1256878578815610065938022400000000, 2046959290878571310305421983481856000000000, 4853749870531268290996216607232176947200000000000
Offset: 1

Views

Author

Labos Elemer, Jul 17 2000

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := EulerPhi[Prime[n]!]; Array[a, 12] (* Amiram Eldar, Jun 03 2024 *)
  • PARI
    a(n) = eulerphi(prime(n)!); \\ Amiram Eldar, Jun 03 2024

Formula

a(n) = phi(prime(n)!) = A000010(A039716(n)) = A048855(prime(n)).

Extensions

a(12)-a(13) from Amiram Eldar, Jun 03 2024