cp's OEIS Frontend

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.

A181622 Sequence starting with 1 such that the sum of any two distinct terms has three distinct prime factors.

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