This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A084561 #16 Dec 14 2019 08:09:05 %S A084561 0,1,2,4,8,15,16,23,27,29,30,32,39,43,45,46,51,53,54,57,58,60,64,71, %T A084561 75,77,78,83,85,86,89,90,92,99,101,102,105,106,108,113,114,116,120, %U A084561 128,135,139,141,142,147,149,150,153,154,156,163,165,166,169,170,172,177,178 %N A084561 Numbers with a square number of 1's in their binary expansion. %C A084561 Begins to differ from A084345 at the 22nd term. %C A084561 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 %H A084561 Amiram Eldar, <a href="/A084561/b084561.txt">Table of n, a(n) for n = 1..10000</a> %t A084561 Select[Range[0,178],IntegerQ[Sqrt[Count[IntegerDigits[#,2],1]]]&] (* _Jayanta Basu_, May 24 2013 *) %o A084561 (PARI) is(n)=issquare(hammingweight(n)) \\ _Charles R Greathouse IV_, Mar 26 2013 %Y A084561 Cf. A001969, A000069, A052294, A084345. %K A084561 easy,nonn,base %O A084561 1,3 %A A084561 _Jason Earls_, Jun 27 2003