  The function h(k) represents the smallest number m such that every sequence
of m consecutive integers contains an integer coprime to the first k primes. We
give a new computational method for calculating strong upper bounds on h(k).
