login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074942 a(n) = phi(n) mod 3. 3

%I

%S 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,

%T 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,

%U 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

%N a(n) = phi(n) mod 3.

%H Antti Karttunen, <a href="/A074942/b074942.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A000010(n) mod 3.

%F a(n) = A010872(A000010(n)). - _Michel Marcus_, Sep 05 2015

%t Table[Mod[EulerPhi[n], 3], {n, 100}] (* _Vincenzo Librandi_, Sep 04 2015 *)

%o (PARI) a(n)=eulerphi(n)%3

%o (MAGMA) [EulerPhi(n) mod 3: n in [1..110]]; // _Vincenzo Librandi_, Sep 04 2015

%Y Cf. A000010, A010872, A074943, A084300.

%K easy,nonn

%O 1,3

%A _Benoit Cloitre_, Oct 04 2002

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 03:02 EDT 2021. Contains 343121 sequences. (Running on oeis4.)