User blog comment:VoidSansXD/Big notation thing/@comment-36957202-20190227175737

A definition that is very similar would be and is more compact and quicker growing:

start solving from right to left


 * 1) is any combinations of [a][b]...[c] where every variable in # is >=1

1.A[1]n=n+1

2.A#[1]n=A#(#(...(A#n)...) with n nests

3.here q=[b-1]...[b-1] with n [b-1]'s A#[k]n=A#q(A#q(...(A#qn)...) with n nests

The limit should be omega squared?