Abstract
Agarwal introduced n-color compositions in 2000 and subsequent research has considered both restricting which parts are allowed and, more recently, which colors are allowed. Here we consider allowing or prohibiting two consecutive colors, focusing on several cases that connect with other types of compositions. We also prove several identities for certain tribonacci numbers. Most proofs are combinatorial, several using the notion of spotted tilings introduced by the first named author in 2012.
| Original language | English |
|---|---|
| Pages (from-to) | 1-16 |
| Number of pages | 16 |
| Journal | Journal of Integer Sequences |
| Volume | 27 |
| Issue number | 7 |
| State | Published - 2024 |
Scopus Subject Areas
- Discrete Mathematics and Combinatorics
Keywords
- bijective combinatorics
- exact enumeration
- integer composition
- n-color composition
- recurrence relation