OFFSET
1,1
COMMENTS
If n is even then for obvious reasons phi(n) will usually be less than or equal to phi(n+1). These are the first few exceptions.
Observation based upon calculation: More than 95% of the terms of this sequence have the final digit of 4 for n <= 10^7.. - Harvey P. Dale, Jul 24 2012
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..5000 (terms 1..1000 from T. D. Noe)
FORMULA
a(n) = 2 * A001837(n) (follows from the definition). - Chris Boyd, Mar 15 2014
EXAMPLE
314 is in the list because phi(314)=156 and phi(315)=144.
MATHEMATICA
Select[2*Range[3000], EulerPhi[#]>EulerPhi[#+1]&] (* Harvey P. Dale, Jul 24 2012 *)
PROG
(PARI) for(n=1, 6000, if(Mod(n, 2)==0 && eulerphi(n) > eulerphi(n+1), print1(n", "))) \\ G. C. Greubel, Feb 27 2019
(Magma) [n: n in [1..6000] | (n mod 2 eq 0) and (EulerPhi(n) gt EulerPhi(n+1))]; // G. C. Greubel, Feb 27 2019
(Sage) [n for n in (1..6000) if mod(n, 2)==0 and euler_phi(n) > euler_phi(n+1)] # G. C. Greubel, Feb 27 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
David Angell (angell(AT)maths.unsw.edu.au), Jun 22 2009
STATUS
approved