For , a finite nonempty set is said to be -Schreier (or maximal -Schreier, respectively) if (or , respectively). For , let Using the Inclusion-Exclusion Principle, Beanland et al. proved the recurrence We show that is a subsequence with terms taken periodically from Padovan-like sequences which satisfy simple recurrence relations. As an application, we obtain an alternative proof of the above linear recurrence. Furthermore, a similar result holds for the sequence that counts maximal -Schreier sets. We end with a discussion of the relation between and .

生成讲解博客的中文版本

生成AI智能校验的中文版本