OFFSET
1,1
COMMENTS
For every n, a(n)==0 (mod 3).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Range[2000], ! Divisible[EulerPhi[#*(# + 1)*(# + 2)/3], EulerPhi[#]] &] (* Amiram Eldar, Mar 01 2020 *)
PROG
(PARI) is(n)=eulerphi(n*(n+1)*(n+2)/3)%eulerphi(n) \\ Charles R Greathouse IV, Mar 05 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 28 2002
STATUS
approved