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 A218697 #13 Jan 13 2013 12:44:57
%S A218697 6,9,14,21,46,49,69,86,94,129,134,141,145,161,166,201,205,206,214,249,
%T A218697 254,301,305,309,321,326,329,334,381,445,446,454,469,489,501,505,526,
%U A218697 529,545,566,581,614,669,681,694,721,734,745,749,766,789,841,849,886,889
%N A218697 Semiprimes that can be written in the form x^2 + 5*y^2 with x, y > 0.
%C A218697 If two primes which end in 3 or 7 and surpass by 3 a multiple of 4 are multiplied, then their product will be composed of a square and the quintuple of another square. (Fermat (1654))
%D A218697 Dedekind R., Theory of Algebraic Integers, Cambridge Univ. Press, 1996 (translation of the 1877 French original), pp. 12-13.
%H A218697 Arkadiusz Wesolowski, <a href="/A218697/b218697.txt">Table of n, a(n) for n = 1..10000</a>
%F A218697 A154778 INTERSECT A001358.
%e A218697 94 = 7^2 + 5*3^2, therefore 94 is a term.
%t A218697 n = 889; limx = Sqrt[n]; limy = Sqrt[n/5]; Select[Union@Flatten@Table[x^2 + 5*y^2, {x, limx}, {y, limy}], # <= n && PrimeOmega[#] == 2 &]
%t A218697 Select[Select[Range[889], PrimeOmega[#] == 2 &], Length@FindInstance[y > 0 && x^2 + 5*y^2 == #, {x, y}, Integers] > 0 &] (* _Arkadiusz Wesolowski_, Jan 13 2013 *)
%Y A218697 Cf. A001358, A154778.
%K A218697 nonn
%O A218697 1,1
%A A218697 _Arkadiusz Wesolowski_, Nov 04 2012