User blog:Primussupremus/more depth in the expansions and theory of my array notation part 2.

This post is the 2nd out of the series of posts detailing how my notation works this time we're doing {a,b,c|d}

To format a rule here is an explanation of what is happening:

{a,b,c|d}= {a,b,c} recursed d times in other words the answer you get from recursing it will go into the b slot.

For example {2,2,2|2}= 2*2=4 for one recursion so the 1st recursion will produce an answer of 2^^2=4 the next recursion produces 2^^2=4.

The rule for this part of the notation is:

{a,b,c|d}= {a,b,c} recursed d times for d>0

if d=1 {a,b,c|d}= {a,b,c}

Otherwise {a,b,c|d}= {a,b,c} recursed into the b slot d times.

To illustrate this last point here is an example:

{3,4,3|3}= 3^^3= 0 recursions

3^(3^27)3= 1 recursion

3^(3^(3^27))3= 2 recursions.

3^(3(^(3^(3^27))))3 = 3 recursions.

So does everyone like this rule I devised?