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.

A366822 a(n) is phi(n^n + 1) where phi is the Euler totient function.

Original entry on oeis.org

1, 1, 4, 12, 256, 1040, 41472, 407680, 16515072, 152845056, 9897840000, 89493288192, 8732596764672, 129785922489600, 10576701872701440, 210729768933600000, 18446676793287966720, 275746753962112254720, 28084363369373740400640, 791359800910482004224000
Offset: 0

Views

Author

Sean A. Irvine, Oct 24 2023

Keywords

Crossrefs

Programs

  • Mathematica
    {1}~Join~Array[EulerPhi[#^# + 1] &, 19] (* Michael De Vlieger, Oct 24 2023 *)
  • PARI
    a(n) = eulerphi(n^n+1);

Formula

a(n) = A000010(A014566(n)).