OFFSET
1,3
COMMENTS
Begins to differ from A084345 at the 22nd term.
There are A003099(n) terms with at most n bits, so a(n) is n sqrt log n times a bounded function of n (which does not tend toward a limit). - Charles R Greathouse IV, Mar 26 2013
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Range[0, 178], IntegerQ[Sqrt[Count[IntegerDigits[#, 2], 1]]]&] (* Jayanta Basu, May 24 2013 *)
PROG
(PARI) is(n)=issquare(hammingweight(n)) \\ Charles R Greathouse IV, Mar 26 2013
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Jason Earls, Jun 27 2003
STATUS
approved