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 A107707 #9 Feb 01 2017 22:20:58 %S A107707 12,28,45,52,63,75,76,99,117,147,148,153,165,172,175,207,245,268,273, %T A107707 279,316,325,333,345,369,385,388,399,412,423,435,436,475,477,507,508, %U A107707 549,561,595,603,651,652,657,665,715,747,759,772,775,777,795,833,845 %N A107707 3-almost primes whose prime factors sum to a prime. %H A107707 Charles R Greathouse IV, <a href="/A107707/b107707.txt">Table of n, a(n) for n = 1..10000</a> %e A107707 a(5) = 63 = 3*3*7 because 3+3+7 = 13 is prime. %t A107707 Select[Range[1000],PrimeOmega[#]==3&&PrimeQ[Total[ Times@@@ FactorInteger[ #]]]&] (* _Harvey P. Dale_, Nov 10 2011 *) %o A107707 (PARI) list(lim)=my(v=List()); forprime(p=2,lim\4, forprime(q=2,min(p,lim\p\2), forprime(r=2,min(q,lim\p\q), if(isprime(p+q+r), listput(v,p*q*r))))); Set(v) \\ _Charles R Greathouse IV_, Feb 01 2017 %K A107707 easy,nonn %O A107707 1,1 %A A107707 _Giovanni Teofilatto_, Jun 10 2005 %E A107707 Corrected and extended by _Ray Chandler_, Jun 12 2005