User blog comment:Cyias123/A new idea/@comment-30754445-20170801111345

I'm sorry to disappoint you, but the process you've described most certainly doesn't surpass array functions. It's actually on the very low end of 4-entry arrays in BEAF.

Even the relatively modest {3,3,3,3}  would be much much larger than your number. It has so many additional levels of recursion that it isn't even funny.