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.

A295502 a(n) = phi(5^n-1), where phi is Euler's totient function (A000010).

Original entry on oeis.org

2, 8, 60, 192, 1400, 4320, 39060, 119808, 894240, 2912000, 24414060, 62208000, 610351560, 1959874560, 13154400000, 44043337728, 380537036928, 997843069440, 9485297382000, 25606963200000, 230106651919200, 748687423334400, 5959800062798400, 15138938880000000
Offset: 1

Views

Author

Seiichi Manyama, Nov 22 2017

Keywords

Comments

Faye et al. prove that no term is of the form 5^k-1. - Michel Marcus, Jun 16 2024

Crossrefs

phi(k^n-1): A053287 (k=2), A295500 (k=3), A295501 (k=4), this sequence (k=5), A366623 (k=6), A366635 (k=7), A366654 (k=8), A366663 (k=9), A295503 (k=10), A366685 (k=11), A366711 (k=12).

Programs

  • Mathematica
    EulerPhi[5^Range[25] - 1] (* Paolo Xausa, Jun 18 2024 *)
  • PARI
    {a(n) = eulerphi(5^n-1)}

Formula

a(n) = n*A027741(n).
a(n) = A000010(A024049(n)). - Michel Marcus, Jun 16 2024