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 A064499 #15 Nov 20 2019 09:31:43
%S A064499 12,16,18,20,28,32,44,45,48,50,52,63,68,75,76,80,81,92,98,99,112,116,
%T A064499 117,124,147,148,153,162,164,171,172,175,176,180,188,192,207,208,212,
%U A064499 236,242,243,244,245,252,256,261,268,272,275,279,284,288,292,300,304
%N A064499 Composite numbers n such that product of aliquot divisors of n is a perfect square.
%H A064499 Amiram Eldar, <a href="/A064499/b064499.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harry J. Smith)
%t A064499 Do[ If[ !PrimeQ[n] && IntegerQ[ Sqrt[ Apply[ Times, Delete[ Divisors[n], -1]]]], Print[n]], {n, 2, 500} ]
%o A064499 (PARI) pad(n)=my(d=divisors(n), p=1); for (i=1, #d-1, p*=d[i]); p
%o A064499 n=0; for (m=2, 10^9, if (!isprime(m) && issquare(pad(m)), write("b064499.txt", n++, " ", m); if (n==1000, break))) \\ _Harry J. Smith_, Sep 16 2009
%o A064499 (PARI) is(n)=!isprime(n) && (ispower(n,4) || numdiv(n)%4==2) && n>1 \\ _Charles R Greathouse IV_, Oct 17 2015
%Y A064499 Cf. A048699, A007956.
%K A064499 base,easy,nonn
%O A064499 1,1
%A A064499 _Robert G. Wilson v_, Oct 05 2001