Minimal Number of Symbols in Context-Free Grammar for a Special One-Letter Language
This is essentially the problem of "addition chains", discussed in great detail in many papers and in Knuth's The Art of Computer Programming.  In brief:  the problem as you have stated it is not known to be NP-hard, but nobody knows an efficient algorithm to find the absolutely minimum.  However, there are good algorithms that come reasonably close to the minimum.