Let (F$_{n}$)$_{n\geq0}$ be the Fibonacci sequence. In 2000, F.Luca proved that F10 = 55 is the largest repdigit (i.e. a number withonly one distinct digit in its decimal expansion) in the Fibonaccisequence. In this note, we show that if Fn · · · F$_{n+(k-1)}$ isa repdigit, with at least two digits, then (k, n) = (1, 10).