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!)
 A284575 a(n) = A048725(n) mod 3. 3
 0, 2, 1, 0, 2, 2, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 1, 0, 2, 2, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 1, 0, 2, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 1, 1, 0, 2, 0, 2, 0, 0, 0, 0, 2, 1, 0, 2, 1, 1, 2, 2, 0, 2, 0, 2, 2, 2, 2, 2, 2, 1, 0, 2, 2, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 2, 1, 0, 2, 2, 0, 0, 0, 2, 0, 2, 2, 2, 2, 2, 0, 2, 1, 0, 0, 0, 1, 1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Antti Karttunen, Table of n, a(n) for n = 0..8192 FORMULA a(n) = A048725(n) mod 3. PROG (Scheme) (define (A284575 n) (modulo (A048725 n) 3)) CROSSREFS Cf. A048725, A284557, A284574. Sequence in context: A263142 A025253 A281228 * A112178 A134663 A000925 Adjacent sequences:  A284572 A284573 A284574 * A284576 A284577 A284578 KEYWORD nonn,base AUTHOR Antti Karttunen, Apr 10 2017 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 June 5 23:10 EDT 2020. Contains 334858 sequences. (Running on oeis4.)