Mathematica novice here.
I want to start with a list of integers that are the product of three distinct primes m,n, and o, where 2 <= m|n|o < 2000.
Sort[Times @@@ Subsets[Select[Range[2000], PrimeQ], {3}]]
How do I find the longest subsequence within this list that consists of consecutive integers?