A254576 Primes p such that phi(p-2) divides p-1 where phi is Euler's totient function (A000010).
3, 5, 17, 257, 65537, 83623937
Offset: 1
Programs
-
Magma
[n: n in [3..10000000] | IsPrime(n) and (n-1) mod EulerPhi(n-2) eq 0];
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.
Comments