English

Sequences Derived from The Symmetric Powers of $\{1,2,\ldots,k\}$

Combinatorics 2024-07-23 v2

Abstract

For a fixed integer kk, we define a sequence Ak=(ak(n))n0A_k=(a_k(n))_{n\geq0} and a corresponding sparse subsequence SkS_k using the cardinality of the nn-th symmetric power of the set {1,2,,k}\{1,2,\ldots, k\}. For k{2,,8}k\in\{2,\dots,8\}, we find recursive formulas for SkS_k, and show that the values ak(0)a_{k}(0), ak(1)a_{k}(1), and ak(3)a_{k}(3) are sufficient for constructing AkA_{k}.

Keywords

Cite

@article{arxiv.2307.07733,
  title  = {Sequences Derived from The Symmetric Powers of $\{1,2,\ldots,k\}$},
  author = {Po-Yi Huang and Wen-Fong Ke},
  journal= {arXiv preprint arXiv:2307.07733},
  year   = {2024}
}