|
|
A079446
|
|
Integers k such that phi(k)*(k-phi(k))+1 is prime.
|
|
2
|
|
|
2, 3, 4, 5, 7, 8, 9, 11, 13, 17, 18, 19, 20, 21, 23, 25, 27, 28, 29, 31, 32, 37, 41, 43, 47, 50, 52, 53, 55, 56, 57, 59, 61, 67, 68, 71, 72, 73, 77, 78, 79, 81, 83, 89, 92, 95, 97, 99, 101, 103, 104, 107, 108, 109, 110, 113, 115, 116, 127, 131, 137, 139, 145
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
phi(8)=4, so 4*(8-4)+1=17.
|
|
MAPLE
|
filter:= proc(n) local p;
p:= numtheory:-phi(n);
isprime(p*(n-p)+1)
end proc:
|
|
MATHEMATICA
|
Select[Range[150], PrimeQ[EulerPhi[#]*(# - EulerPhi[#]) + 1] &] (* G. C. Greubel, Jan 18 2019 *)
|
|
PROG
|
(PARI) for (n=2, 100, if (isprime(eulerphi(n)*(n-eulerphi(n))+1), print1(n", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|