A286576 a(n) = A132971(n) mod 3.

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

Offset

0,2

Links

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

Index entries for sequences related to binary expansion of n

Formula

a(n) = A010872(A132971(n)) = A132971(n) mod 3.

Prog

(Scheme) (define (A286576 n) (modulo (A132971 n) 3))
(Python)
from sympy import mobius, prime
def a053645(n): return n - 2**(n.bit_length()-1)
def b(n): return n + 1 if n<2 else prime(1 + (len(bin(n)[2:]) - bin(n)[2:].count("1"))) * b(a053645(n))
def a(n): return mobius(b(n))%3 # Indranil Ghosh, May 30 2017

Crossrefs

Cf. A010872, A132971.

Sequence in context: A193863 A363566 A273496 * A322523 A333210 A285193

Adjacent sequences: A286573 A286574 A286575 * A286577 A286578 A286579

Keyword

nonn,base

Author

Antti Karttunen, May 30 2017

Status

approved