Abstract
The Fibonacci sequence is the fixed point beginning with of morphism . In this paper, we get the explicit expressions of all squares and cubes, then we determine the number of distinct squares and cubes in for all , where is the prefix of of length . By establishing and discussing the recursive structure of squares and cubes, we give algorithms for counting the number of repeated squares and cubes in for all , and get explicit expressions for some special such as (the Fibonacci number) etc., which including some known results such as in A.S.Fraenkel and J.Simpson, J.Shallit et al.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.