login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A280700 Binary weight of terms of A005187: a(n) = A000120(A005187(n)). 6
0, 1, 2, 1, 3, 1, 2, 3, 4, 1, 2, 3, 3, 4, 3, 3, 5, 1, 2, 3, 3, 4, 3, 3, 4, 5, 3, 3, 4, 4, 3, 4, 6, 1, 2, 3, 3, 4, 3, 3, 4, 5, 3, 3, 4, 4, 3, 4, 5, 6, 3, 3, 4, 4, 3, 4, 5, 5, 3, 4, 4, 5, 6, 4, 7, 1, 2, 3, 3, 4, 3, 3, 4, 5, 3, 3, 4, 4, 3, 4, 5, 6, 3, 3, 4, 4, 3, 4, 5, 5, 3, 4, 4, 5, 6, 4, 6, 7, 3, 3, 4, 4, 3, 4, 5, 5, 3, 4, 4, 5, 6, 4, 6, 6, 3, 4, 4, 5, 6, 4, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A000120(A005187(n)).
a(n) = A001221(A283475(n)) = A001222(A283475(n)))) = A001222(A280705(n)).
MATHEMATICA
Table[DigitCount[2 n - DigitCount[2 n, 2, 1], 2, 1], {n, 0, 120}] (* Michael De Vlieger, Mar 18 2017 *)
PROG
(Scheme) (define (A280700 n) (A000120 (A005187 n)))
(PARI)
b(n) = if(n<1, 0, b(n\2) + n%2);
for(n=0, 150, print1(b(2*n - b(2*n)), ", ")) \\ Indranil Ghosh, Mar 21 2017
(Python)
def A(n): return bin(2*n - bin(2*n)[2:].count("1"))[2:].count("1")
print([A(n) for n in range(151)]) # Indranil Ghosh, Mar 21 2017
CROSSREFS
Sequence in context: A054843 A277427 A231631 * A356149 A038566 A020652
KEYWORD
nonn
AUTHOR
Antti Karttunen, Mar 16 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)