User blog:Primussupremus/the next step in my notation.

This is part 2 of my notation hope you enjoy:

Last time I showed you the first part of the notation mainly [A,^(n-2),B] where n is a hyperoperator this time I'm going to show you how to get beyond this.

Suppose that we want to express a number like the Graham Gardner number in this format how can we do it in a way that looks clean?

Yes in fact we can because we can have [3,6,3|64] this 3^^^^3 recursed 64 times giving us the definition of grahams number.

[A,^(n-2),B|P] is equal to [A,^(n-2),B] recursed P times.

As we have got  that definition out of the way we can begin to create some numbers in this format. As you can see this idea can get us well past grahams number and other smallish googolisms,next time I'll use the ideas posted in this blog to extend to even larger numbers.
 * [5,5,5|5]=5^^^5 recursed 5 times.
 * [10,100,10|40]=10^(98)10 recursed 40 times.
 * [3,6,3|1000000]=A Forcal in Aarex's Graham generator.
 * [500,502,500|5000]=500^(500)500 recursed 5000 times.