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”).
%I #3 Mar 30 2012 17:22:32
%S 7,23,31,43,59,67,71,73,101,103,107,127,131,137,139,179,199,211,223,
%T 227,239,269,281,283,307,311,331,347,359,367,379,383,431,439,463,467,
%U 479,487,491,503,523,547,563,571,607,619,631,643,659,661,683,691,719,727
%N Primes p such that k = 2p is the smallest positive solution to the equation phi(p+k) = phi(p) + phi(k), where phi is Euler's totient function.
%C Note that for all primes p > 3, phi(3p) = phi(p) + phi(2p).
%t lst={}; Do[p=Prime[n]; k=1; While[EulerPhi[p+k]!=EulerPhi[p]+EulerPhi[k], k++ ]; If[k==2p, AppendTo[lst, p]], {n, 3, 200}]; lst
%Y Cf. A066426 (least k such that phi(n+k)=phi(n)+phi(k)).
%K nonn
%O 1,1
%A _T. D. Noe_, Jan 19 2004