Skip to content

Erdős problem 359

Suppose monotone sequence AA 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 ak klog⁡klog⁡log⁡ka_k ~ \frac{k \log k}{\log \log k}.

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal4 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Where the source files it575 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.