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.

A319370 Composite numbers k such that phi(k)^phi(k) == k + 1 (mod k^2).

Original entry on oeis.org

91, 18227, 28605, 137481, 538849, 2832797, 3220333, 384792005
Offset: 1

Views

Author

Altug Alkan, Sep 17 2018

Keywords

Comments

Composite numbers k such that (k-phi(k))^phi(k) == 1 (mod k^2).

Crossrefs

Programs

  • PARI
    isok(n) = n>1 && !isprime(n) && Mod(n-eulerphi(n), n^2)^eulerphi(n)==1;