A284575 a(n) = A048725(n) mod 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

Offset

0,2

Links

Antti Karttunen, Table of n, a(n) for n = 0..8192

Index entries for sequences related to binary expansion of n

Formula

a(n) = A048725(n) mod 3.

Prog

(Scheme) (define (A284575 n) (modulo (A048725 n) 3))

Crossrefs

Cf. A048725, A284557, A284574.

Sequence in context: A356261 A356262 A281228 * A112178 A134663 A000925

Adjacent sequences: A284572 A284573 A284574 * A284576 A284577 A284578

Keyword

nonn,base

Author

Antti Karttunen, Apr 10 2017

Status

approved