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?