Can number of states in DFA be greater than $2^n$ when language-equivalent NFA has $n$ states? As title says, can the number of states in DFA be greater than $2^n$ when language-equivalent NFA has $n$ states - that is if the NFA recognizes the same language as the DFA and has $n$ states, can DFA have more than $2^n$ states?

I think it is, and this is trivially. However Wikipedia seeems to write that it is not possible to have more than $2^n$ states. So comes the question.
it surely can, but it needs not. Using the powerset construction you can convert any $n$-state NFA into a DFA with at most $2^n$ states.