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 A100593 #3 Mar 30 2012 18:40:21
%S A100593 33,62,105,122,135,174,285,214,294,315,318,366,525,405,394,474,498,
%T A100593 585,495,529,765,645,735,693,945,705,761,825,1155,1109,901,989,1049,
%U A100593 1123,1365,1063,1121,1181,1243,1129,1231,1169,1349,1485,1399,1577
%N A100593 Greatest positive integer that can be represented as the sum of exactly two semiprimes in exactly n ways.
%F A100593 a(n) = max{i such that i = A001358(j) + A001358(k) in n ways}.
%e A100593 a(0) = 33 is only a conjecture, based on computer searches by Lior Manor and by Ray Chandler. a(1) = 62 because 62 = 58 + 4 is the only way to partition 62 into two semiprimes.
%Y A100593 Cf. A001358, A076768, A100570, A072966.
%K A100593 nonn
%O A100593 0,1
%A A100593 _Jonathan Vos Post_, Nov 30 2004