  The Jacobsthal function has aroused interest in various contexts in the past
decades. We review several algorithmic ideas for the computation of
Jacobsthal's function for primorial numbers and discuss their practicability
regarding computational effort. The respective function values were computed
for primes up to 251. In addition to the results including previously unknown
data, we provide exhaustive lists of all sequences of the appropriate maximum
lengths in ancillary files.
