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
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

Index entries for sequences computed from exponents in factorization of n

MATHEMATICA

Mod[DivisorSigma[0, Range[110]], 3] (* Harvey P. Dale, Dec 22 2013 *)

PROG

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

(Scheme) (define (A074943 n) (modulo (A000005 n) 3)) ;; Antti Karttunen, Jul 26 2017

CROSSREFS

Cf. A000005.

Sequence in context: A049850 A319954 A050949 * A272011 A236374 A045719

Adjacent sequences:  A074940 A074941 A074942 * A074944 A074945 A074946

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 3 14:58 EST 2021. Contains 341762 sequences. (Running on oeis4.)