Integer complexity and cographs

The integer complexity of a number \(n\) is the minimum number of ones needed to express \(n\) as a parenthesized combination of sums and products of ones. For instance, 10 has complexity 7 as it can be expressed using seven ones, but not fewer: