User blog comment:Ynought/Extended array hierarchy/@comment-35470197-20190117222337/@comment-35470197-20190123224654

Yeah, but as I pointed out, your way to define \((a,\ldots,b)_{c,ldots,d}\) does not make the corresponding ordinal in FGH grow, because you iterated the fastest function only twice.

In order to make the ordinal grow, you need to give a stronger recursion such as \((5,3) = (((((5,2),2),2),2),2)\) (to define \((n,3)\) by iterating the fastest function \((n,2)\) \(n\)-times). It is a little difficult to image for this iteration for longer arrays, and that is why I recommended you to start with arrays of length two or three.