OFFSET
0,3
COMMENTS
Conjecture: for every x>=0 there is an i such that a(n)>x for n>i.
Comment from N. J. A. Sloane, Nov 21 2013: See also the conjecture in A231898.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
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)
a214560 = a023416 . a000290 -- Reinhard Zumkeller, Nov 20 2013
(Python)
def A214560(n):
....return bin(n*n)[2:].count('0') # Chai Wah Wu, Sep 03 2014
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Alex Ratushnyak, Jul 21 2012
STATUS
approved