User blog comment:Ikosarakt1/Introduction to pentational arrays/@comment-5529393-20130413060024/@comment-5150073-20130416145655

Yes, it is really important, because Bowers defined his notation quite so, and I just want to comprehend how it really works. If we don't match exactly with the number of entries, we can't solve the numbers like triakulus and kungulus, but only their approximations.

The number of entries in array before applying main rules in A & b[p] equal to A because we decompose power towers using normal tetrational array rules, so the number of entries in, say, X^^(X*2) & 3 equivalent to X^^(p*2) & 3. When we apply "array of" rule 1 on the topmost power tower 1 (X^X^X = X^X^3), we just remove curly brackets from it ({X^X^X}^{X^X^X} = {X^X^X}^{X^X^3}). It again doesn't change the number of entries.