An exponential behaviour was proposed by Harley who wrote that his algorithm has a "run-time something like O(2^(2r/ln(r)))".
We suggest :
cpu-secs = a * 2^(b r/log(r))
and obtain constants "a" and "b" via least mean square error.
Highest value for r : 92 ( gap size 184 )
