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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A303780 Binary weight of A303775(n). 4
 0, 1, 2, 1, 2, 1, 2, 3, 4, 3, 2, 1, 3, 2, 3, 2, 4, 1, 2, 3, 2, 4, 2, 3, 5, 3, 4, 3, 2, 1, 4, 3, 2, 5, 4, 3, 2, 4, 3, 2, 4, 3, 4, 3, 6, 5, 4, 3, 2, 5, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 5, 3, 4, 3, 4, 1, 4, 3, 2, 4, 3, 2, 5, 3, 2, 4, 3, 5, 4, 3, 2, 4, 3, 6, 5, 4, 2, 5, 3, 4, 3, 4, 3, 4, 5, 4, 3, 4, 3, 2, 4, 3, 5, 4, 3, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Antti Karttunen, Table of n, a(n) for n = 0..16383 FORMULA a(n) = A000120(A303775(n)). For all n >= 0, abs(a(n+1)-a(n)) = A000120(A303775(n+1) XOR A303775(n)), where XOR is a bitwise exclusive or, A003987. PROG (PARI) A303780(n) = hammingweight(A303775(n)); \\ For other needed code, see A303775. CROSSREFS Cf. A000120, A303775, A303779. Cf. also A304089. Sequence in context: A083409 A344779 A317586 * A234022 A261273 A097454 Adjacent sequences:  A303777 A303778 A303779 * A303781 A303782 A303783 KEYWORD nonn,base AUTHOR Antti Karttunen, May 06 2018 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.

Last modified December 9 03:42 EST 2021. Contains 349625 sequences. (Running on oeis4.)