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.

A366821 a(n) is phi(n^n-1) where phi is the Euler totient function.

Original entry on oeis.org

2, 12, 128, 1400, 30240, 264992, 6635520, 141087744, 5890320000, 114117380608, 4662793175040, 99053063903040, 5470524984113280, 167080949856000000, 9208981628670443520, 413582117375670921216, 29531731481729468006400, 659473218553437863041320
Offset: 2

Views

Author

Sean A. Irvine, Oct 24 2023

Keywords

Crossrefs

Programs

  • Maple
    a:= n-> numtheory[phi](n^n-1):
    seq(a(n), n=2..20);  # Alois P. Heinz, Oct 26 2023
  • Mathematica
    Array[EulerPhi[#^# - 1] &, 18, 2] (* Michael De Vlieger, Oct 24 2023 *)
  • PARI
    a(n) = eulerphi(n^n-1);

Formula

a(n) = A000010(A048861(n)).