Maybe you can do some sort of dynamic programming approach.
Let P(n, V) be the smallest m such that there is an increasing sequence 
n, a1, a2, ..., m whose product is the vector V.  When V is empty,
P(n, V) = G(n). 

Then for example P(2, V) = P(6, V^6).