Combinatorial constructions for the Zeckendorf sum of digits of polynomial values
From MaRDI portal
Publication:386499
DOI10.1007/S11139-012-9422-6zbMATH Open1356.11007OpenAlexW2022304193MaRDI QIDQ386499FDOQ386499
Authors: Thomas Stoll
Publication date: 9 December 2013
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-012-9422-6
Recommendations
- The Zeckendorf expansion of polynomial sequences
- The parity of the Zeckendorf sum-of-digits function
- On the sum of digits of the Zeckendorf representations of two consecutive numbers
- On Gelfond-type problem for generalized Zeckendorf representations
- On the number of summands in Zeckendorf decompositions
Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Rate of growth of arithmetic functions (11N56)
Cites Work
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Automatic Sequences
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- Sur les nombres qui ont des propriétés additives et multiplicatives données
- Title not available (Why is that?)
- Fibonacci numbers at most one away from a perfect power
- A summation formula involving Fibonacci digits
- Generalized Zeckendorf expansions
- On the binary digits of a power
- The sum of digits of polynomial values in arithmetic progressions
- The parity of the Zeckendorf sum-of-digits function
- Numbers with fixed sum of digits in linear recurrent number systems
- Stolarsky’s conjecture and the sum of digits of polynomial values
- The sum of digits of \(n\) and \(n^2\)
- CONGRUENCES DE SOMMES DE CHIFFRES DE VALEURS POLYNOMIALES
- ON THE BITS COUNTING FUNCTION OF REAL NUMBERS
- The Binary Digits of a Power
- Title not available (Why is that?)
- The sum-of-digits function of polynomial sequences
- The Zeckendorf expansion of polynomial sequences
- Title not available (Why is that?)
- The Sum-of-Digits Function of Squares
- The sum of digits of squares
Cited In (7)
- Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
- On Gelfond-type problem for generalized Zeckendorf representations
- Stolarsky’s conjecture and the sum of digits of polynomial values
- Title not available (Why is that?)
- Pseudorandom sequences derived from automatic sequences
- Title not available (Why is that?)
- On Zeckendorf and base \(b\) digit sums
This page was built for publication: Combinatorial constructions for the Zeckendorf sum of digits of polynomial values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386499)