OFFSET
1,1
COMMENTS
There are only 43 terms below 10^7, and 1843 terms below 10^12. [Jud McCranie, Feb 13 2012]
LINKS
Jud McCranie, Table of n, a(n) for n = 1..1843 (terms < 10^12)
F. Firoozbakht, Puzzle 466. phi(n-1)=phi(n)=phi(n+1), in C. Rivera's Primepuzzles.
Kevin Ford, Solutions of phi(n)=phi(n+k) and sigma(n)=sigma(n+k), arXiv:2002.12155 [math.NT], 2020.
MATHEMATICA
Select[Range[5000000], EulerPhi[#] == EulerPhi[# + 5] &] (* Vincenzo Librandi, Sep 08 2016 *)
Position[Partition[EulerPhi[Range[55*10^5]], 6, 1], _?(#[[1]] == #[[6]]&), {1}, Heads->False]//Flatten (* Harvey P. Dale, Nov 10 2016 *)
PROG
(PARI) {op=vector(N=5); for( n=1, 1e7, if( op[n%N+1]+0==op[n%N+1]=eulerphi(n), print1(n-N, ", ")))}
(Magma) [n: n in [1..5000000] | EulerPhi(n) eq EulerPhi(n+5)]; // Vincenzo Librandi, Sep 08 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Jan 05 2011
STATUS
approved