The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074942 a(n) = phi(n) mod 3. 7
1, 1, 2, 2, 1, 2, 0, 1, 0, 1, 1, 1, 0, 0, 2, 2, 1, 0, 0, 2, 0, 1, 1, 2, 2, 0, 0, 0, 1, 2, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 2, 0, 1, 1, 1, 0, 2, 2, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 2, 0, 2, 0, 2, 2, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 1, 1, 0, 1, 0, 2, 1, 1, 0, 0, 2, 0, 1, 0, 2, 0, 0, 0, 1, 1, 2, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = A000010(n) mod 3.
a(n) = A010872(A000010(n)). - Michel Marcus, Sep 05 2015
MATHEMATICA
Table[Mod[EulerPhi[n], 3], {n, 100}] (* Vincenzo Librandi, Sep 04 2015 *)
PROG
(PARI) a(n)=eulerphi(n)%3
(Magma) [EulerPhi(n) mod 3: n in [1..110]]; // Vincenzo Librandi, Sep 04 2015
CROSSREFS
Sequence in context: A039965 A300481 A368509 * A043754 A144191 A288007
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Oct 04 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 23:28 EDT 2024. Contains 372497 sequences. (Running on oeis4.)