|
|
A249541
|
|
Numbers m such that phi(m-2) divides m-1 where phi is Euler's totient function (A000010).
|
|
2
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The first 5 known Fermat primes from A019434 are in this sequence.
Corresponding values of numbers k(m) = (m-1) / phi(m-2): 2, 3, 2, 2, 2, 2, 2, 2, ...
Conjecture: 4 is the only number m such that 3*phi(m-2) = m-1. (See comment in A203966.)
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
4 is in the sequence because phi(4-2) = 1 divides 4-1 = 3.
|
|
PROG
|
(Magma) [n: n in [3..10000000] | (n-1) mod EulerPhi(n-2) eq 0]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|