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!)
A074943 tau(n) (mod 3). 2

%I

%S 1,2,2,0,2,1,2,1,0,1,2,0,2,1,1,2,2,0,2,0,1,1,2,2,0,1,1,0,2,2,2,0,1,1,

%T 1,0,2,1,1,2,2,2,2,0,0,1,2,1,0,0,1,0,2,2,1,2,1,1,2,0,2,1,0,1,1,2,2,0,

%U 1,2,2,0,2,1,0,0,1,2,2,1,2,1,2,0,1,1,1,2,2,0,1,0,1,1,1,0,2,0,0,0,2,2,2,2,2

%N tau(n) (mod 3).

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

%H <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>

%t Mod[DivisorSigma[0,Range[110]],3] (* _Harvey P. Dale_, Dec 22 2013 *)

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

%o (Scheme) (define (A074943 n) (modulo (A000005 n) 3)) ;; _Antti Karttunen_, Jul 26 2017

%Y Cf. A000005.

%K easy,nonn

%O 1,2

%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 17 16:12 EDT 2021. Contains 343063 sequences. (Running on oeis4.)