login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A271656
Odd primes p such that phi(p+1) = phi(phi(p-2)+1).
6
5, 7, 17, 71, 257, 487, 761, 1151, 4327, 18287, 52721, 65537, 150767, 221471, 446597, 830861, 1002467, 2202787, 4978367, 6088337, 7534511, 9887651, 14278391, 21453101, 25032437, 31176863, 47290697, 51182837, 54264257, 80228717, 83623937, 138307877
OFFSET
1,1
COMMENTS
The first 4 known Fermat primes > 3 from A019434 are in the sequence.
LINKS
EXAMPLE
257 is a term because phi(257+1) = phi(258) = 84 = phi(phi(257-2)+1) = phi(phi(255)+1) = phi(128+1) = phi(129).
MATHEMATICA
Select[Prime@ Range[10^6], EulerPhi[# + 1] == EulerPhi[EulerPhi[# - 2] + 1] &] (* Michael De Vlieger, Apr 11 2016 *)
PROG
(Magma) [n: n in [2..10^8] | IsPrime(n) and EulerPhi(n+1) eq EulerPhi(EulerPhi(n-2)+1)]
(PARI) is(n) = eulerphi(n+1)==eulerphi(eulerphi(n-2)+1)
forprime(p=3, , if(is(p), print1(p, ", "))) \\ Felix Fröhlich, Apr 23 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Apr 11 2016
EXTENSIONS
Definition adjusted and more terms added by Felix Fröhlich, Apr 23 2016
STATUS
approved