|
|
A193461
|
|
Numbers n such that phi(n) divides 2*(n-1).
|
|
1
|
|
|
1, 2, 3, 4, 5, 6, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence contains all prime numbers. Only two composite numbers are known in this sequence: 4, 6.
Larger composite terms, if any, must be Carmichael numbers (A002997). - Ivan Neretin, Aug 30 2015
None of the 246683 Carmichael numbers < 10^16 are in the sequence. - Robert Israel, Sep 06 2015
|
|
LINKS
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
Union@Table[If[IntegerQ[2*(n-1)/EulerPhi[n]], n], {n, 300}]
|
|
PROG
|
(Magma) [n: n in [1..300] | ((2*n-2) mod EulerPhi(n) eq 0)]; // Vincenzo Librandi, Sep 01 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|