On generalized Stanley sequences

Abstract: Let

m a t h b b N

denote the set of all nonnegative integers. Let

k g e 3

be an integer and

A_{0} = a_{1}, d o t s, a_{t}

(a_{1} < l d o t s < a_{t})

be a nonnegative set which does not contain an arithmetic progression of length

k

. We denote

A = a_{1}, a_{2}, d o t s

defined by the following greedy algorithm: if

l g e t

and

a_{1}, d o t s, a_{l}

have already been defined, then

a_{l + 1}

is the smallest integer

a > a_{l}

such that

a_{1}, d o t s, a_{l} c u p a

also does not contain a

k

-term arithmetic progression. This sequence

A

is called the Stanley sequence of order

k

generated by

A_{0}

. In this paper, we prove some results about various generalizations of the Stanley sequence.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: On generalized Stanley sequences