User blog comment:DrCeasium/Hyperfactorial array notation: Analysis part 2/@comment-5529393-20130527105642/@comment-7484840-20130530160307

Yes, it needs work, and i'm looking for some other way of representing the reappearing strings of numbers. as for the [3,3,3,3], that was just assuming there was an n! at the beginning, and then would work as n![3,3,3,3] would: there would be a lot more recursion, but this was not shown for the huge amount of time it would take (starting off: n![3,3,3,3] = ((...(n![2,3,3,3]) ![2,3,3,3]...) ![2,3,3,3]) ![2,3,3,3] with n  ![2,3,3,3]'s.)