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 A164343 #17 Jul 12 2022 21:15:23 %S A164343 9,49,169,225,625,841,961,2916,3249,3721,3969,10609,12100,12769,13924, %T A164343 14641,15625,16129,39601,41209,42849,44944,45369,45796,47524,52900, %U A164343 56644,58081,60516,62001,64009,65025,151321,154449,155236,156025,161604,163216,167281 %N A164343 A positive integer is included if it is a square that contains the same number of 0's as 1's when represented in binary. %H A164343 Michael S. Branicky, <a href="/A164343/b164343.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harvey P. Dale) %t A164343 Select[Range[500]^2,DigitCount[#,2,1]==DigitCount[#,2,0]&] (* _Harvey P. Dale_, Nov 18 2014 *) %o A164343 (Python) %o A164343 def bal(n): return n and n.bit_length() == n.bit_count() * 2 %o A164343 print([s for s in (k*k for k in range(403)) if bal(s)]) # _Michael S. Branicky_, Jul 12 2022 %Y A164343 Cf. A031443, A164344. %K A164343 base,nonn %O A164343 1,1 %A A164343 _Leroy Quet_, Aug 13 2009 %E A164343 More terms from _Sean A. Irvine_, Oct 08 2009