Consider a set $ A $ with no $ p $-term arithmetic progressions for $ p $ prime. The $ p $-
Stanley sequence of a set $ A $ is generated by greedily adding successive integers that do …

Given a set of integers with no 3-term arithmetic progression, one constructs a Stanley
sequence by choosing integers greedily without forming such a progression. This paper …

Given a set of integers containing no 3-term arithmetic progressions, one constructs a
Stanley sequence by choosing integers greedily without forming such a progression …

An integer sequence is said to be 3-free if no three elements form an arithmetic progression.
A Stanley sequence {an} is a 3-free sequence constructed by the greedy algorithm. Namely …

Odlyzko and Stanley introduced a greedy algorithm for constructing infinite sequences with
no 3-term arithmetic progressions when beginning with a finite set with no 3-term arithmetic …

From an initial list of nonnegative integers, we form a Stanley sequence by recursively
adding the smallest integer such that the list remains increasing and no three elements form …

Stanley and Odlyzko proposed a method for greedily constructing sets with no 3-term
arithmetic progressions. It is conjectured that there is a dichotomy between such sequences …

Given a finite set of nonnegative integers A with no three-term arithmetic progressions, the
Stanley sequence generated by A, denoted as S (A), is the infinite set created by beginning …

Let NN denote the set of all nonnegative integers. Let k ≥ 3 k≥ 3 be an integer and A_
0={a_ 1,\dots, a_ t\}(a_ 1< ⋯< a_ t) A 0= a 1,⋯, at (a 1<⋯< at) be a nonnegative set which …

Consider the sequence $\mathcal {V}(2, n) $ constructed in a greedy fashion by setting $
a_1= 2$, $ a_2= n $ and defining $ a_ {m+ 1} $ as the smallest integer larger than $ a_m …