Use some mathematical operations to make an expression equal 93.
You must use each one of the digits 2, 0, 2, 2 exactly once, and no other digits.
To score the solutions, your set of operations used must be least powerful.
Least powerful operations
Note that some general constructions like: using a successor function, using square roots and logarithms, using increasing and decreasing operations combined with rounding functions, ... potentially allow to express any number.
Therefore, your goal is to use a set of operations that is least powerful.
Let A and B be two sets of operations. If A can be used to make x integers in an interval [1,N] and B can be used to make y integers in an interval [1,N], then A is less powerful than B if x < y as N goes to infinity. (Unless the operation set can be used to make every number, then it is infinitely powerful and by definition, the worst solution.)
Due to practical constrains, I might estimate the score based on the interval [1,N] for some reasonable N, under some reasonable restrictions such as allowing at most 10 consecutive uses of an unary operation.
The least powerful solution will be accepted.
Only established operations are allowed. That is, the operation must appear in a peer reviewed article. For example, double factorial (mathworld) has multiple such references listed on the mathworld website (eg. Meserve, B. E. "Double Factorials." Amer. Math. Monthly 55, 425-426, 1948.).
On the other hand,
(a @ b) := 93 if a=b=2 else 0 (defining own operations) would not be allowed.
Obscure sequences (I'm sure there are many oeis.org sequences that contain 93 as a constant), are not allowed. This includes almost all oeis.org sequences.
I said almost all, since for example, using parentheses ( ) as the binomial coefficient (n k) is allowed due to lateral-thinking tag, which is then A007318 sequence in the OEIS.