436341

Appears in sequences

• Hard numbers: a(n) = smallest positive number m with f(m) = n, where f(m) is the smallest number of digits that are needed to construct m using only 1's, 2's and any number of +, -, *, ^ signs, not allowing concatenation of the digits.at n=16A060274
• Smallest number requiring n digits for its representation in the "Terrible Twos Problem" without using multidigit expressions.at n=15A260016