The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319370 Composite numbers k such that phi(k)^phi(k) == k + 1 (mod k^2). 0
91, 18227, 28605, 137481, 538849, 2832797, 3220333, 384792005 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Composite numbers k such that (k-phi(k))^phi(k) == 1 (mod k^2).
LINKS
PROG
(PARI) isok(n) = n>1 && !isprime(n) && Mod(n-eulerphi(n), n^2)^eulerphi(n)==1;
CROSSREFS
Sequence in context: A370780 A168624 A131442 * A116507 A083828 A348088
KEYWORD
nonn,more
AUTHOR
Altug Alkan, Sep 17 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 00:16 EDT 2024. Contains 372549 sequences. (Running on oeis4.)