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 A273323 #16 May 24 2016 03:37:13
%S A273323 1,3,9,15,16,32,0,56,36,80,0,140,0,192,144,216,0,300,0,336,0,0,0,540,
%T A273323 0,0,0,0,0,720,0,840,0,0,0,1260,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A273323 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A273323 a(n) = greatest number k <= n^2 having exactly n divisors, or 0 if no such k exists.
%C A273323 The sequence is zero for n>36, since A005179(n) > n^2 for all n > 36.
%e A273323 a(4) = 15, because 15 is the greatest number <= 4^2 with exactly 4 divisors.
%t A273323 Seq := {}; For[n = 1, n < 50, n++, AppendTo[Seq, a = Max[Select[Range[n^2], DivisorSigma[0, #] == n &]]; If[a == -Infinity, 0, a]]]; Seq
%Y A273323 Cf. A000005, A005179, A035033.
%K A273323 nonn,easy
%O A273323 1,2
%A A273323 _Carlos Eduardo Olivieri_, May 20 2016