Combinatorial constructions for the Zeckendorf sum of digits of polynomial values

DOI10.1007/s11139-012-9422-6zbMath1356.11007OpenAlexW2022304193MaRDI QIDQ386499

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

zbMATH Keywords

Fibonacci numbersLucas numbersperfect powersdigital expansionssum of digitsZeckendorf expansion

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Rate of growth of arithmetic functions (11N56)

Related Items

Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences ⋮ Pseudorandom sequences derived from automatic sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Zeckendorf expansion of polynomial sequences
• The sum of digits of squares
• 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
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• 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²
• CONGRUENCES DE SOMMES DE CHIFFRES DE VALEURS POLYNOMIALES
• ON THE BITS COUNTING FUNCTION OF REAL NUMBERS
• The Binary Digits of a Power
• Automatic Sequences
• The sum-of-digits function of polynomial sequences
• Sur les nombres qui ont des propriétés additives et multiplicatives données
• The Sum-of-Digits Function of Squares