We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible.

We show that the number of ternary words of length n avoiding abelian cubes grows faster than r^n, where r = 2^{1/24}