Let j(n) denote the smallest positive integer m such that every sequence of m consecutive integers contains an integer prime to n. Let Pn be the product of the first n primes and define h(n) = j(Pn). Presently, h(n) is only known for n ≤ 24. In this paper, we describe an algorithm that enabled the calculation of h(n) for n < 50. 0.