login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286576 a(n) = A132971(n) mod 3. 2
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 (list; graph; refs; listen; history; text; internal format)
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, log

import math

def A(n): return n - 2**int(math.floor(log(n, 2)))

def b(n): return n + 1 if n<2 else prime(1 + (len(bin(n)[2:]) - bin(n)[2:].count("1"))) * b(A(n))

def a(n): return mobius(b(n))%3 # Indranil Ghosh, May 30 2017

CROSSREFS

Cf. A010872, A132971.

Sequence in context: A104624 A193863 A273496 * A322523 A333210 A285193

Adjacent sequences:  A286573 A286574 A286575 * A286577 A286578 A286579

KEYWORD

nonn,base

AUTHOR

Antti Karttunen, May 30 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 07:08 EDT 2020. Contains 334584 sequences. (Running on oeis4.)