User blog:DerivedSugar177/Doom Function

Obelisk Function
O(n) = fω (n)

O1(n) = O(n)

O2(n) = fε0 (n)

O3(n) = fζ0 (n)

OO(n) = fΓ0 (n) = φ(1,0,0)

OOO(n) = φ(1,0,0,0)

O(1,2) = O(n)

O(2,2) = OOO..OO(n), with O(1,2) O's

O(1,3) = O(n,2)

O(1,1,2) = O(n,n)

O(1,1,..,1,2), with n 1's  =  O(n$)

O(1,2$) = O(n$)

O(2,2$) = now with O(1,2$) 1's

O(1,3$) = O(n,2$)

O(1,1,2$) = O(n,n$)

O(1,1,..,1,1$), with n 1's  =  O(n£)

if $ : 1st symbol

£ : 2nd symbol

@ : nth symbol, for example : O(n@) = O(1,1,..1,1@-1) , @-1 = the n-1th symbol

limit : O(n@)

what is it in the FGH??