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 A110188 #9 Jan 31 2017 16:42:16 %S A110188 8,18,27,30,42,50,66,70,78,98,102,105,110,114,125,130,138,154,170,174, %T A110188 182,186,190,195,222,230,231,238,242,246,255,258,266,282,285,286,290, %U A110188 310,318,322,338,343,354,357,366,370,374,402,406,410,418,426,429,430 %N A110188 3-almost primes p * q * r not relatively prime to p+q+r. %C A110188 A110187 is the converse, 3-almost primes p * q * r which are relatively prime to p+q+r. %H A110188 Charles R Greathouse IV, <a href="/A110188/b110188.txt">Table of n, a(n) for n = 1..10000</a> %e A110188 a(1) = 8 because 8 = 2^3, which has a prime factor 2 in common with prime 2 + 2 + 2 = 6. %e A110188 30 is in the sequence, since 30 = 2 * 3 * 5, which is in fact divisible by 2 + 3 + 5 = 10. %o A110188 (PARI) list(lim)=my(v=List()); forprime(p=2, lim\4, forprime(q=2, min(p, lim\2\p), my(pq=p*q, t); forprime(r=2, min(lim\pq, q), t=r*pq; if(gcd(t, p+q+r)>1, listput(v, t))))); Set(v) \\ _Charles R Greathouse IV_, Jan 31 2017 %Y A110188 Cf. A014612, A110187, A110227, A110228, A110229, A110230, A110231, A110232, A110289, A110290, A110296, A110297. %K A110188 easy,nonn %O A110188 1,1 %A A110188 _Jonathan Vos Post_, Jul 15 2005 %E A110188 Extended by _Ray Chandler_, Jul 20 2005