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 A228057 #5 Aug 14 2013 12:22:08
%S A228057 27,45,63,75,99,117,125,147,153,171,175,207,243,245,261,275,279,325,
%T A228057 333,343,363,369,387,405,423,425,475,477,507,531,539,549,567,575,603,
%U A228057 605,637,639,657,675,711,725,747,775,801,833,845,847,867,873,891,909,925
%N A228057 Odd numbers of the form p * m^2, where p is prime and m > 1.
%C A228057 This sequence is the second step toward candidates for odd perfect numbers, A228058.
%H A228057 T. D. Noe, <a href="/A228057/b228057.txt">Table of n, a(n) for n = 1..10000</a>
%t A228057 nn = 1000; Union[Select[Flatten[Table[p*n^2, {p, Prime[Range[2, PrimePi[nn/4]]]}, {n, 3, Sqrt[nn/2], 2}]], # < nn &]]
%o A228057 (Haskell)
%o A228057 a228057 n = a228057_list !! (n-1)
%o A228057 a228057_list = filter odd a228056_list -- _Reinhard Zumkeller_, Aug 14 2013
%Y A228057 Cf. A228056, A228058.
%K A228057 nonn
%O A228057 1,1
%A A228057 _T. D. Noe_, Aug 13 2013