The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $��(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $��$ appears infinite many times in the sequence which is arranged as $��_p$ $(p\ge 1)$. Here we distinguish $��_p\neq��_q$ if $p\neq q$. In this paper, we give algorithm for counting the number of repeated palindromes in $\mathbb{F}[1,n]$ (the prefix of $\mathbb{F}$ of length $n$). That is the number of the pairs $(��, p)$, where $��$ is a palindrome and $��_p\prec\mathbb{F}[1,n]$. We also get explicit expressions for some special $n$ such as $n=f_m$ (the $m$-th Fibonacci number). The similar results are also given to the Tribonacci sequence, the fixed point beginning with $a$ of morphism $��(a,b,c)=(ab,ac,a)$.

12 pages, 2 figures. arXiv admin note: text overlap with arXiv:1601.04391