A284555 -id:A284555 - cp's OEIS frontend

A284557 a(n) = A048727(n) mod 3.

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

Offset: 0

Graph
List
Refs
Listen
History
Text
Internal format

Antti Karttunen, Apr 10 2017

nonn
base

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

Row 3 of array A284270 (after the initial zero).

Cf. A048727, A284555 (positions of zeros), A284574, A284575.

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

(define (A284557 n) (modulo (A048727 n) 3))
(define (A284557 n) (A284270bi 3 n)) ;; For A284270bi see A284270.

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

cp's OEIS Frontend

A284557 a(n) = A048727(n) mod 3.

Views

Author

Keywords

Links

Crossrefs

Programs

Python

Scheme

Formula