Abstract
Let $ (T_{n})_{n\ge 0} $ be the sequence of Tribonacci numbers defined by $ T_0=0 $, $ T_1=T_2=1$, and $ T_{n+3}= T_{n+2}+T_{n+1} +T_n$ for all $ n\ge 0 $. In this note, we use of lower bounds for linear forms in logarithms of algebraic numbers and the Baker-Davenport reduction procedure to find all Tribonacci numbers that are concatenations of two repdigits.



![Author ORCID: We display the ORCID iD icon alongside authors names on our website to acknowledge that the ORCiD has been authenticated when entered by the user. To view the users ORCiD record click the icon. [opens in a new tab]](https://www.cambridge.org/engage/assets/public/coe/logo/orcid.png)