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 A323066 #20 Sep 03 2021 12:11:20
%S A323066 0,1,2,3,6,7,11,14,15,22,27,30,31,38,47,54,59,62,63,78,91,102,111,118,
%T A323066 123,126,127,134,155,174,191,206,219,230,239,246,251,254,255,286,315,
%U A323066 342,367,390,411,430,447,462,475,486,495,502,507,510,511,539,582,623,662
%N A323066 Numbers whose binary complement (A035327) is a square.
%C A323066 The binary complement of every square is in the sequence. Using that might ease computation. - _David A. Corneth_, Jan 08 2019
%e A323066 The binary complement of 22 is 9. Because 9 is a square, 22 is in the sequence.
%e A323066 The binary complement of 4^2 = 16 is 15 so 15 is in the sequence. - _David A. Corneth_, Jan 08 2019
%p A323066 q:= n-> issqr(Bits[Nand](n$2)):
%p A323066 select(q, [$0..1000])[]; # _Alois P. Heinz_, Sep 03 2021
%t A323066 Select[Range@ 700, IntegerQ@ Sqrt@ FromDigits[IntegerDigits[#, 2] /. {0 -> 1, 1 -> 0}, 2] &] (* _Michael De Vlieger_, Jan 04 2019 *)
%o A323066 (PARI) bc(n) = bitxor(n, 2^(1+logint(max(n, 1), 2))-1); \\ A035327
%o A323066 isok(n) = issquare(bc(n)); \\ _Michel Marcus_, Jan 04 2019
%Y A323066 Cf. A035327, A000290, A000225 is a subsequence.
%K A323066 nonn,easy,base
%O A323066 1,3
%A A323066 _Alex Ratushnyak_, Jan 03 2019