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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A232243 a(n) = wt(n^2) - wt(n), where wt(n) = A000120(n) is the binary weight function. 1
 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 2, 0, 1, 0, 0, 0, 1, 1, 2, 1, 3, 2, -1, 0, 2, 1, 2, 0, 1, 0, 0, 0, 1, 1, 2, 1, 3, 2, 3, 1, 2, 3, 3, 2, 4, -1, -1, 0, 2, 2, 1, 1, 4, 2, 2, 0, 2, 1, 2, 0, 1, 0, 0, 0, 1, 1, 2, 1, 3, 2, 3, 1, 3, 3, 5, 2, 3, 3, 0, 1, 3, 2, 4, 3, 3, 3, 2, 2, 5, 4, 0, -1, 1, -1, -1, 0, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,12 COMMENTS A077436 gives n for which this sequence is zero. A094694 gives n for which this sequence is negative. LINKS FORMULA a(n) = A159918(n) - A000120(n). EXAMPLE a(5) : 5 is 101, 25 is 11001, so a(5) is 3 - 2 = 1. a(23) : 23 is 10111, 529 is 10001001, so a(23) = 3 - 4 = -1. PROG (JavaScript) function bitCount(n) { var i, c, s; c=0; s=n.toString(2); for (i=0; i

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.

Last modified May 21 03:31 EDT 2022. Contains 353887 sequences. (Running on oeis4.)