# Lower bound on the number of solutions of N-queens problem

The OEIS lists the number of solutions of N-queens problem (Number of ways of placing n nonattacking queens on an n X n board). However, no formula is given. It is easy to observe that each number in the sequence is more than double its predecessor.

Is there any proven asymptotic exponential lower bound on the number of solutions?

Let $$Q(N)$$ be the number we are interested in. In Corollary 1 on the paper below it is proven that $$Q(N) > 4^{N/5}$$ for any $$N$$ divisible by $$5$$. They also conjecture that $$\lim_{n \to \infty} \frac{log Q(n)}{n \log n} > 0$$
Rivin, Igor; Vardi, Ilan; Zimmermann, Paul, The $$n$$-queens problem, Am. Math. Mon. 101, No. 7, 629-639 (1994). ZBL0825.68479.
You may also be interested in arXiv:1705.05225 by Zur Luria where Theorem 1.1 gives a lower bound on the toroidal version (hence, also the usual version) of the problem of $$n^{\Omega(n)}$$ fro $$n = 2^{2k}+1$$.