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 A082295 #19 Sep 25 2022 04:57:10
%S A082295 36,64,72,100,108,128,144,180,192,196,200,216,225,252,256,288,300,320,
%T A082295 324,360,384,392,396,400,432,441,448,450,468,484,500,504,512,540,576,
%U A082295 588,600,612,640,648,675,676,684,700,704,720,729,756,768,784,792,800
%N A082295 Numbers having more than two square divisors > 1.
%C A082295 If n is in the sequence, so is m*n. - _Charles R Greathouse IV_, Oct 16 2015
%C A082295 The asymptotic density of this sequence is 1 - (6/Pi^2) * (1 + Sum_{p prime} (1/p^2 + 1/(p^3*(p+1)) + 1/(p^4*(p+1)))) = 0.07033321843992718294... . - _Amiram Eldar_, Sep 25 2022
%H A082295 Amiram Eldar, <a href="/A082295/b082295.txt">Table of n, a(n) for n = 1..10000</a>
%F A082295 A046951(a(n)) > 3.
%F A082295 a(n) < 17n for n > 25. - _Charles R Greathouse IV_, Oct 16 2015
%e A082295 n=200 has 4 square divisors: 1, 4, 25 and 100, therefore 200 is a term.
%t A082295 Select[Range[1000],Length[Rest[Select[ Divisors[#], IntegerQ[ Sqrt[ #]]&]]]> 2&] (* _Harvey P. Dale_, Jan 08 2014 *)
%o A082295 (PARI) is(n)=my(f=vecsort(factor(n)[,2],,4)); #f && (f[1]>5 || (#f>1 && f[2]>1)) \\ _Charles R Greathouse IV_, Oct 16 2015
%Y A082295 Cf. A082294, A048111, A046951.
%K A082295 nonn
%O A082295 1,1
%A A082295 _Reinhard Zumkeller_, Apr 08 2003