Counting Unions of Schreier Sets

Abstract: A subset of positive integers $F$ is a Schreier set if it is non-empty and $|F|\leqslant \min F$ (here $|F|$ is the cardinality of $F$). For each positive integer $k$, we define $k\mathcal{S}$ as the collection of all the unions of at most $k$ Schreier sets. Also, for each positive integer $n$, let $(k\mathcal{S})<sup>n$ be the collection of all sets in $k\mathcal{S}$ with the maximum element equal to $n$. It is well-known that the sequence $(|(1\mathcal{S})<sup>n|)_{n=1}<sup>\infty$ is the Fibbonacci sequence. In particular, the sequence satisfies a linear recurrence. We generalize this statement, namely, we show that the sequence $(|(k\mathcal{S})<sup>n|)_{n=1}<sup>\infty$ satisfies a linear recurrence for every positive $k$.