What is the complexity of counting the number of solutions of a P-Space Complete problem? How about higher complexity classes?
The number of satisfying assignments to a boolean formula equals the number of valid quantifications of the formula.  The inductive proof is quite elegant. So #P = #PSpace.