We consider the problem of evaluating for a function 蠁∈L2[0,1)s. In situations where I(蠁) can be approximated by an estimate of the form , with a point set in [0,1)s, it is now well known that the OP(N−1/2) Monte Carlo convergence rate can be improved by taking for the first c40ba0be65147197a2967b432a28f6f4" title="Click to view the MathML source">N=位bm points, 05c47acf25ae070626dd5cd5072" title="Click to view the MathML source">位∈{1,…,b−1}, of a scrambled (t,s)-sequence in base b≥2. In this paper we derive a bound for the variance of scrambled net quadrature rules which is of order O(N−1) without any restriction on N. As a corollary, this bound allows us to provide simple conditions to get, for any pattern of N, an integration error of size OP(N−1/2) for functions that depend on the quadrature size N. Notably, we establish that sequential quasi-Monte Carlo (Gerber & Chopin, 2015) reaches the OP(N−1/2) convergence rate for any values of N. In a numerical study, we show that for scrambled net quadrature rules we can relax the constraint on N without any loss of efficiency when the integrand 蠁 is a discontinuous function while, for sequential quasi-Monte Carlo, taking N=位bm may only provide moderate gains.