@article{Bauer2008PrimeFO,
title={Prime factors of consecutive integers},
author={Mark Bauer and Michael A. Bennett},
journal={Math. Comput.},
year={2008},
volume={77},
pages={2455-2459}
}

This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in the sequence of integers all of whose prime factors exceed k. This algorithm enables us to show that f(k) is not monotone, verifying a conjecture of Ecklund and Eggleton.