login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A084300
a(n) = phi(n) mod 6.
6
1, 1, 2, 2, 4, 2, 0, 4, 0, 4, 4, 4, 0, 0, 2, 2, 4, 0, 0, 2, 0, 4, 4, 2, 2, 0, 0, 0, 4, 2, 0, 4, 2, 4, 0, 0, 0, 0, 0, 4, 4, 0, 0, 2, 0, 4, 4, 4, 0, 2, 2, 0, 4, 0, 4, 0, 0, 4, 4, 4, 0, 0, 0, 2, 0, 2, 0, 2, 2, 0, 4, 0, 0, 0, 4, 0, 0, 0, 0, 2, 0, 4, 4, 0, 4, 0, 2, 4, 4, 0, 0, 2, 0, 4, 0, 2, 0, 0, 0, 4, 4, 2, 0, 0, 0
OFFSET
1,3
LINKS
FORMULA
a(n) = A000010(n) mod 6.
a(n) = A010875(A000010(n)). - Amiram Eldar, Aug 17 2024
MATHEMATICA
a[n_] := Mod[EulerPhi[n], 6]; Array[a, 100] (* Amiram Eldar, Aug 17 2024 *)
PROG
(PARI) A084300(n) = (eulerphi(n)%6); \\ Antti Karttunen, Aug 22 2017
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Labos Elemer, Jun 02 2003
STATUS
approved