|
%I #19 Sep 08 2022 08:46:11
%S 3,5,17,257,977,3257,5189,11717,13367,22937,65537,307397,491537,
%T 589409,983777,1659587,2822717,3137357,5577827,6475457,7378373,
%U 8698097,10798727,32235737,37797437,39220127,39285437,51555137,52077197,56992553,63767927,70075997
%N Primes p such that phi(p-2) = phi(p-1).
%C First 5 Fermat primes from A019434 are terms of this sequence.
%C a(2) = 5 is only term of a(n) such that a(n) - 2 is a prime q, i.e., prime 3 is only prime q such that phi(q) = phi(q+1).
%C If there are any other Fermat primes, they will not be in the sequence. - _Robert Israel_, Mar 31 2015
%H Amiram Eldar, <a href="/A256510/b256510.txt">Table of n, a(n) for n = 1..819</a> (terms below 10^13, calculated from the b-file at A001274)
%e Prime 17 is in the sequence because phi(15) = phi(16) = 8.
%p with(numtheory): A256510:=n->`if`(isprime(n) and phi(n-2) = phi(n-1), n, NULL): seq(A256510(n), n=1..10^5); # _Wesley Ivan Hurt_, Mar 31 2015
%t Select[Prime@ Range@ 100000, EulerPhi[# - 2] == EulerPhi[# - 1] &] (* _Michael De Vlieger_, Mar 31 2015 *)
%o (Magma) [n: n in [3..10^7] | IsPrime(n) and EulerPhi(n-2) eq EulerPhi(n-1)]
%Y Cf. A000010, A000215, A001274, A019434.
%K nonn
%O 1,1
%A _Jaroslav Krizek_, Mar 31 2015
|
