2016
DOI: 10.48550/arxiv.1603.04211
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

The number of distinct and repeated squares and cubes in the Fibonacci sequence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Using these properties, we determined the number of palindromes (resp. k-th powers of words) occurring in F [1, n] (the prefix of F of length n) and T [1, n] for all n ≥ 1, see [8,9,10]. These topics are of great importance in computer science.…”
Section: Introductionmentioning
confidence: 99%
“…Using these properties, we determined the number of palindromes (resp. k-th powers of words) occurring in F [1, n] (the prefix of F of length n) and T [1, n] for all n ≥ 1, see [8,9,10]. These topics are of great importance in computer science.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, for all n, m ≥ 1, we give: (1) explicit expressions of A(n), C(n), B(t m ) and D(t m ); (2) fast algorithms for counting B(n) and D(n). We also considered this problem in the Fibonacci sequence, see [4].…”
Section: Introductionmentioning
confidence: 99%