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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074941 a(n) = sigma(n) mod 3. 7
 1, 0, 1, 1, 0, 0, 2, 0, 1, 0, 0, 1, 2, 0, 0, 1, 0, 0, 2, 0, 2, 0, 0, 0, 1, 0, 1, 2, 0, 0, 2, 0, 0, 0, 0, 1, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 2, 1, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 1, 2, 0, 0, 2, 0, 1, 0, 0, 2, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 2, 0, 0, 1, 0, 0, 2, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA a(n) = A010872(A000203(n)). - Antti Karttunen, Nov 05 2017 MAPLE A074941:= n-> (numtheory[sigma](n) mod 3): seq (A074941(n), n=1..105); # Jani Melik, Jan 26 2011 PROG (PARI) a(n)=sigma(n)%3 CROSSREFS Cf. A000203, A010872. Differs from A002324 for the first time at n=49, where a(49) = 0, while A002324(49) = 3. Sequence in context: A112762 A145171 A117154 * A171774 A002324 A101671 Adjacent sequences:  A074938 A074939 A074940 * A074942 A074943 A074944 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.

Last modified February 25 12:01 EST 2020. Contains 332233 sequences. (Running on oeis4.)