The limit of repetition thresholds of rich sequences

The repetition threshold of a class of sequences is the smallest number r such that a sequence from the class contains no repetition with exponent $> r$. We focus on the class Cd of d-ary sequences rich in palindromes. In 2020, Currie, Mol, and Rampersad determined the repetition threshold for C₂. In 2024, Currie, Mol and Peltomäki found the repetition threshold for C₃ and conjectured that the repetition threshold for Cd tends to 2 with d growing to infinity. Here we verify their conjecture.