The k-generalized Fibonacci sequence (F (k) n ) n resembles the Fibonacci sequence in that it starts with 0, . . ., 0, 1 (a total of k terms) and each term afterwards is the sum of the k preceding terms.F. Luca [4] in 2000 and recently D. Marques [5] proved that 55 and 44 are the largest numbers with only one distinct digit (so called repdigits) in the sequences (Frespectively.Further, Marques conjectured that there are no repdigits having at least 2 digits in a k-generalized Fibonacci sequence for any k > 3.In the present paper, we confirm this conjecture.