login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A110228
4-almost primes p * q * r * s not relatively prime to p + q + r + s.
12
16, 24, 36, 60, 81, 84, 100, 126, 132, 140, 150, 156, 196, 204, 220, 228, 234, 260, 276, 308, 315, 330, 340, 342, 348, 364, 372, 375, 380, 444, 460, 476, 484, 490, 492, 495, 510, 516, 525, 532, 558, 564, 572, 580, 585, 620, 625, 636, 644, 650, 666, 676, 690
OFFSET
1,1
COMMENTS
p, q, r, s are not necessarily distinct. The converse to this is A110227: 4-almost primes p * q * r * s which are relatively prime to p+q+r+s.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
84 is in this sequence because 84 = 2^2 * 3 * 7 and the sum of these prime factors is 2 + 2 + 3 + 7 = 14 = 2 * 7, which is a divisor of 84.
PROG
(PARI) list(lim)=my(v=List()); forprime(p=2, lim\8, forprime(q=2, min(p, lim\4\p), my(pq=p*q); forprime(r=2, min(lim\pq\2, q), my(pqr=pq*r, t); forprime(s=2, min(lim\pqr, r), t=pqr*s; if(gcd(t, p+q+r+s)>1, listput(v, t)))))); Set(v) \\ Charles R Greathouse IV, Jan 31 2017
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Jul 16 2005
EXTENSIONS
Corrected and extended by Ray Chandler, Jul 20 2005
STATUS
approved