Some identities involving Prouhet-Thue-Morse sequence and its relatives

2014/09/29 by Byszewski, Jakub, Ulas, Maciej · 1 citation
#11A63 #11B37 #11B85 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1409.8118

Abstract

Let s_k(n) denote the sum of digits of an integer n in base k. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form ∑_i=0^2ⁿ-1(-1)^s₂(i)(x+i)^m for m=n and m=n+1, we consider the sequence of polynomials f_m,n^{\mathbf u}(x)=∑_i=0^kⁿ-1ζ_k^s_k(i)(x+\mathbf u(i))^m. defined for sequences \bf u(i) satisfying a certain recurrence relation. We prove that computing these polynomials is essentially equivalent with computing their constant term and we find an explicit formula for this number. This allows us to prove several interesting identities involving sums of binary digits. We also prove some related results which are of independent interests and can be seen as further generalizations of certain sums involving Prouhet-Thue-Morse sequence.

Cited by

• A Generalized Digit Map: Periodicity, Prouhet-Tarry-Escott Solutions, and Summation Identities

Related

• A Fibonacci type sequence with Prouhet-Thue-Morse coefficients
• Infinite products involving binary digit sums
• On formal inverse of the Prouhet-Thue-Morse sequence
• Thue--Morse along the sequence of cubes
• The level of distribution of the sum-of-digits function in arithmetic progressions