OFFSET
1,2
MATHEMATICA
t = Table[Count[Range@ n, k_ /; EulerPhi@ n == EulerPhi[n + k]], {n, 3600}]; TakeWhile[Flatten[FirstPosition[t, #] & /@ Range@ Max@ t] /. n_ /; MissingQ@ n -> 0, # != 0 &] (* Michael De Vlieger, Apr 25 2016, Version 10.2 *)
PROG
(Sage) L=[sum([1 for k in [1..n] if euler_phi(n)==euler_phi(n+k)]) for n in [1..4000]]
print([L.index(i)+1 for i in [1..50]])
CROSSREFS
KEYWORD
nonn
AUTHOR
Tom Edgar, Apr 25 2016
STATUS
approved