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”).
%I #12 Sep 16 2017 00:33:20
%S 1,29,41,281,401,1089,1585,2289,4629,27293,74873,965813,2536781,
%T 4479197,36730306,150318056,4527046433
%N Sequence starting with 1 such that the sum of any two distinct terms has three distinct prime factors.
%C Choose the first number not leading to a contradiction.
%e Each of the three pairwise sums of the subset {29, 41, 281} is the product of three distinct prime factors: {2*5*7, 2*5*31, 2*7*23}.
%p with(numtheory):nn:=200000:T:=array(1..nn): U:=array(1..nn): for p from 1 to
%p nn do: T[p]:=p:U[p]:=1:od:for u from 1 to 20 do: k:=1+u:for n from u+1 to nn
%p do:s:=T[n]+T[u]:s1:=nops(factorset(s)):s2:=bigomega(s):if s1=3 and s2=3 then
%p U[k]:=T[n]:k:=k+1:else fi:od:for i from 1 to nn do:T[i]:=U[i]:od:od:for j from
%p 1 to 30 do:printf(`%d, `, T[j]):od:
%Y Cf. A180514, A180565, A180615, A181620.
%K nonn
%O 1,2
%A _Michel Lagneau_, Jan 31 2011
%E a(12)-a(17) from _Donovan Johnson_, Feb 14 2011