User blog:Primussupremus/The next stage for my notation ideas.

Last time we looked at (a,b,c#[x]) this time we will look at some ideas for the next steps in the notation.

The idea I have is cycling the recursions to produce much larger numbers like so: (a,b,c#[x]|{Y}) is equal to (a,b,c#[x]) recursed an arbritary number of times Y. For example (5,Y,5#[5,Y,5]) could be recursed (5,Y,5#[5,Y,5]) times. This constitutes for one cycle you then repeat the process previously described for n-1 times where n is the previous result. In total you need to do Y cycles of recursions.