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!)
A084300 a(n) = phi(n) mod 6. 5

%I #10 Aug 23 2017 06:08:32

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

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

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

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

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

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

%o (PARI) A084300(n) = (eulerphi(n)%6); \\ _Antti Karttunen_, Aug 22 2017

%Y Cf. A000010, A054763, A074942, A084299, A084301.

%K easy,nonn

%O 1,3

%A _Labos Elemer_, Jun 02 2003

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 April 19 16:08 EDT 2024. Contains 371794 sequences. (Running on oeis4.)