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 A168472 #7 Apr 29 2018 21:37:52
%S A168472 6,16,30,45,66,88,114,147,181,216,254,293,339,390,445,502,560,622,687,
%T A168472 756,830,907,989,1074,1160,1247,1338,1431,1525,1620,1726,1837,1952,
%U A168472 2070,2189,2311,2434,2563,2696,2830,2971,3113,3256,3401,3547,3702,3860,4019
%N A168472 Partial sums of products of two distinct primes (A006881).
%H A168472 Robert Israel, <a href="/A168472/b168472.txt">Table of n, a(n) for n = 1..10000</a>
%p A168472 N:= 1001: # to get all a(n) where A006881(n) < N
%p A168472 Primes:= select(isprime, [2, seq(2*k+1, k=1..floor(N/2))]):
%p A168472 L:= sort(convert({seq(seq(p*q, q=Primes[1..ListTools:-BinaryPlace(Primes, N/p)]), p=Primes)} minus {seq(p^2, p=Primes)},list)):
%p A168472 ListTools:-PartialSums(L); # _Robert Israel_, Apr 29 2018
%t A168472 f[n_]:=Last/@FactorInteger[n]=={1,1}; s=0;lst={};Do[If[f[n],AppendTo[lst,s+=n]],{n,6!}];lst
%t A168472 With[{nn=50},Take[Accumulate[Union[Times@@@Subsets[Prime[Range[nn]],{2}]]],nn]] (* _Harvey P. Dale_, Aug 08 2013 *)
%K A168472 nonn
%O A168472 1,1
%A A168472 _Vladimir Joseph Stephan Orlovsky_, Nov 26 2009