User blog:Primussupremus/linear array.

[a,b]=a+b.

[a,b,c]=a^(b) c.

[a,b,c (d)] = a,b,c recursed d times.

[a,b,c (d,e)]= [a,b,c (d)] recursed [a,b,c(d)] times for 1 cycle of recursion then repeated again until you have done e cycles of recursion.

[1,2]=3

[2,3,4]=2^^^4=2^^(2^^(2^^2))=2^^(2^^(4))=2^^(2^2^2^2)=2^^(65536).

[3,3,3 (2)] = 3 followed by 3^^^3 up arrows then 3.

[3,3,3(2,5)] = [3,3,3(2)] up arrows for 1 cycle if we call this A then the next 1 will have A number of up arrows between the 3's. In total you have to do [3,3,3(2)] times for 1 complete cycle. So the number of complete cycles is 5 as e=5.