|
|
A214560
|
|
Number of 0's in binary expansion of n^2.
|
|
5
|
|
|
1, 0, 2, 2, 4, 2, 4, 3, 6, 4, 4, 2, 6, 4, 5, 4, 8, 6, 6, 4, 6, 3, 4, 7, 8, 5, 6, 4, 7, 5, 6, 5, 10, 8, 8, 6, 8, 5, 6, 4, 8, 6, 5, 4, 6, 3, 9, 8, 10, 7, 7, 7, 8, 4, 6, 5, 9, 6, 7, 5, 8, 6, 7, 6, 12, 10, 10, 8, 10, 7, 8, 6, 10, 7, 7, 4, 8, 6, 6, 8, 10, 7, 8, 5, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Conjecture: for every x>=0 there is an i such that a(n)>x for n>i.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
|
|
PROG
|
(Python)
for n in range(300):
b = n*n
c = 0
while b>0:
c += 1-(b&1)
b/=2
print c+(n==0),
(PARI) vector(66, n, b=binary((n-1)^2); sum(j=1, #b, 1-b[j])) /* Joerg Arndt, Jul 21 2012 */
(Haskell)
(Python)
....return bin(n*n)[2:].count('0') # Chai Wah Wu, Sep 03 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|