Erdős Problem #271 — Let A(n)={a0<a1<⋯ }A(n)=\{a_0<a_1<\cdots\} be the sequence defined by a0=0a_0=0 and a1=na_1=n, and for k≥1k\geq 1 define ak+1a_{k+1} as the least positive integer such that there is no three-term arithmetic progression i…

Let A(n)={a0<a1<⋯ }A(n)=\{a_0<a_1<\cdots\} be the sequence defined by a0=0a_0=0 and a1=na_1=n, and for k≥1k\geq 1 define ak+1a_{k+1} as the least positive integer such that there is no three-term arithmetic progression in {a0,…,ak+1}\{a_0,\ldots,a_{k+1}\}. Can the aka_k be explicitly determined? How fast do they grow?

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.