|
|
A254576
|
|
Primes p such that phi(p-2) divides p-1 where phi is Euler's totient function (A000010).
|
|
2
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The first 5 known Fermat primes from A019434 are terms.
Conjecture: also primes p such that 2*phi(p-2) = p-1 (i.e., primes in A232720).
|
|
LINKS
|
|
|
PROG
|
(Magma) [n: n in [3..10000000] | IsPrime(n) and (n-1) mod EulerPhi(n-2) eq 0]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|