There is a stright formula for calculate n Power Sets P(A) of a A set with m members By using Cantor's Theorem: if We have a Set A, with n members the Cardinality of the Power Set is $P(A)=2^n$.
There is Formula to calculate  n Power Sets $P(...P(P(A))...)$ of a set A with m elements without doing the simple iteration  $(((2^2)^2)..)^2^m$ n times?
Many thanks
 A: The term $(((2^2)^2)\ldots)^2$ simplifies to $2^{2^n}$.This follows from the general identity $(x^m)^n=x^{m\cdot n}$ and induction.
However, what you should actually be computing (as S4M points out in the comments) is an expression like
$$
2^{2^{2^{2^{2^n}}}}
$$
which does not simplify any further.
A: The correct formula is $$\large{2^{\left(2^{\left(2^{\dots(2^n)}\right)}\right)}}\;.$$ That is, you start with $2^n$ for the cardinality of $\wp(A)$ when $|A|=n$, then get $2^{2^n}=2^{(2^n)}$ for the cardinality of $\wp(wp(A))$, and so on. I know of no simpler form for this iterated power.
A: Once you have corrected the formulation of your question as noted in the comments, you have an expression for the cardinality of the power set iterate.
You can express comparable expressions more economically using Knuth's up arrow notation or use a recurrence such as the Ackermann Function to express similar numbers in a different way. Neither of these would change the value or make it more easy to calculate.
The notations would have to be adapted to express the values you want - if such values were common enough in practical work, adapted notations to express them efficiently would no doubt catch on.
