Erdős problem 359

Suppose monotone sequence $A$ satisfies the following: A 0 = 1 and for all j, A (j + 1) is the smallest natural number that cannot be written as a sum of consecutive terms of A 0, ..., A j. Then it is conjectured that $$a_k ~ \frac{k \log k}{\log \log k}$$.