On terms of linear recurrence sequences with only one distinct block of digits
DOI10.4064/CM124-2-1zbMATH Open1246.11036OpenAlexW2321432119MaRDI QIDQ3174463FDOQ3174463
Publication date: 14 October 2011
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/cm124-2-1
Recommendations
linear recurrence sequenceFibonacci numbersreduction methodLucas numbersdigitslinear forms in logarithm
Radix representation; digital problems (11A63) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Linear forms in logarithms; Baker's method (11J86)
Cited In (9)
- Lucas numbers as sums of two repdigits
- Title not available (Why is that?)
- Can a Lucas number be a sum of three repdigits?
- Pell and Pell-Lucas numbers as sums of two repdigits
- The proof of a conjecture concerning the intersection of \(k\)-generalized Fibonacci sequences
- Tribonacci numbers with two blocks of repdigits
- Distinct digits in basebexpansions of linear recurrence sequences
- k-generalized Fibonacci numbers which are concatenations of two repdigits
- Fibonacci numbers which are concatenations of two repdigits
This page was built for publication: On terms of linear recurrence sequences with only one distinct block of digits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174463)