Linear Lynx Notation is defined as follows:
An expression has the format a[b,c,d,...,z], where a to z are non-negative integers.
Every expression results in a number:
Let # denote a possibly empty list of non-negative integers seperated by commas
If b ≠ 0, a[b,#] = a[b-1,#][b-1,#]...[b-1,#][b-1,#] with a copies of "[b-1,#]"
a[] = a+1
a[#,0] = a[#]
Otherwise, a[0,0,...,0,0,c] with n copies of 0 inside the brackets = a[a,a,..,a,a,c-1] with n copies of "a" inside the brackets
For example, an expansion of 2[0,0,1] is 2[0,0,1] = 2[2,2,0] = 2[2,2], and so on.