Erdős problem 359 · problems.science

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}$ .

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

359.lean

Retained formal statement4 of 4

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 the first few terms of $A$ are $1,2,4,5,8,10,14,15,...$ .

FormalConjectures/ErdosProblems/359.leanErdos359.erdos_359.variants.isGoodFor_1_low_values1 lineExact file

1∀ (A : ℕ → ℕ), Erdos359.IsGoodFor A 1 → A '' Set.Iic 7 = {1, 2, 4, 5, 8, 10, 14, 15}

TestStatement only, no proof

Sources

Search problems.science