Is the cardinality of any possible infinite set equal to the cardinality of some member of the set below?
Set W:
- Base case: ℕ ∈ W
- Constructor case: If n is in W, then P(n) is in W.
That is, the base case of W is the set of natural numbers. The constructor case is the power set of a case in W. Yielding the set {N, P(ℕ), P(P(ℕ), ...}
Is there any infinite set whose cardinality would not equal the cardinality of a member of W?
Yes. Take the union of all sets in $W$. This set is at least as large as each individual member, and since each member is strictly larger than the last, this new set must be larger than all of them.
What you're describing is the $\beth$ sequence: $\beth_0$ is the cardinality of the set of natural numbers; $\beth_{\alpha + 1}$ is the cardinality of the power set of $\beth_{\alpha}$. But we can define $\beth_{\omega}$ to be the union of $\beth_n$ for $n$ finite, and keep going - $\beth_{\omega + 1}$ is the cardinality of the power set of that, and so on. In fact, for any cardinal $\kappa$, we can define $\beth_{\kappa}$. Even this isn't exhaustive: there's a cardinal $\kappa$ so that $\kappa = \beth_{\kappa}$ (so $\kappa = \beth_{\beth_{\beth\ldots}}$) but there's also a power set of that, which is strictly larger.
Also, the Continuum Hypothesis states that there is no cardinal strictly larger than $\mathbb{N}$ and strictly smaller than its power set; this is independent of the axioms, which means that whether or not it's true depends on which mathematical universe you're working in. So, depending on the situation, it may be that there are also cardinalities in between the ones on your list.