On the number of sparse paving matroids

Let sp(n) be the number of sparse paving matroids on the ground set {1,...,n}. We prove that loglogsp(n)=n-(3/2)logn+O(loglogn), and we conjecture that the same equality applies to the number of all matroids on the set {1,...,n}.