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.

A377678 a(n) = phi(n^n - n) where phi is the Euler totient function.

Original entry on oeis.org

1, 8, 72, 768, 12400, 217728, 7112448, 94371840, 2594586816, 69139840000, 2584376931840, 58779453358080, 4367959006806720, 100089965305451520, 3251736576000000000, 200445251536048619520, 12343971160877345120064, 422076038504126628593664
Offset: 2

Views

Author

Sean A. Irvine, Nov 03 2024

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := EulerPhi[n^n - n]; Array[a, 20, 2] (* Amiram Eldar, Nov 04 2024 *)
  • PARI
    a(n) = eulerphi(n^n-n);

Formula

a(n) = A000010(A061190(n)).