We use random matrix theory to give heuristics for the moments of L-values of elliptic curves, and via a BSD-based discretisation proceed to estimate the number of elliptic curves (up to X) with rank 2. We discuss the difference between various ways of ordering the elliptic curves, and present some computational data related the heuristics we derive.