A284574 a(n) = A048724(n) mod 3.

0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 2, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 1, 2, 2, 0, 2, 0, 0, 0, 2, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 2, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 1, 0, 1

Offset: 0

Author

Antti Karttunen, Apr 10 2017

Keywords

• nonn
• base

Links

• Antti Karttunen, Table of n, a(n) for n = 0..8192
• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A048724, A284557, A284575.

Programs

Python

def A284574(n): return (n^ n<<1)%3 # Chai Wah Wu, Jun 29 2022

Scheme

(define (A284574 n) (modulo (A048724 n) 3))

Formula

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