کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4653196 | 1632758 | 2017 | 20 صفحه PDF | دانلود رایگان |
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
Journal: European Journal of Combinatorics - Volume 59, January 2017, Pages 51–70