






















A multipermutation with $k$ copies each of $1\ldots n$ is Carlitz if neighbours are different. We enumerate these objects for $k=2,3,4$ and derive recurrences. In particular, we prove and improve a conjectured recurrence for $k=3$, stated in OEIS, the Online Encyclopedia of Integer Sequences.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。