Let (n,n+1,n+2) represent a triplet of consecutive numbers, each having 5 distinct prime factors.

Find tne value of the lowest n.

(In reply to computer solution by Charlie)

IMHO, you have created a sequence of numbers  representing the 1st in a a triplet of consecutive numbers, each having AT LEAST 5 distinct prime factors.

While similar lists  e.g.  A117969 EXIST, this one is absent.

IMHO , it qualifies- please consider to submit it.

Posted by Ady TZIDON on 2015-07-03 08:51:49