Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653196 | European Journal of Combinatorics | 2017 | 20 Pages |
An integer sequence is said to be 3-free if no three elements form an arithmetic progression. A Stanley sequence {an}{an} is a 3-free sequence constructed by the greedy algorithm. Namely, given initial terms a0