Some identities involving Prouhet-Thue-Morse sequence and its relatives
Abstract
Let sk(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=02n-1(-1)s2(i)(x+i)m for m=n and m=n+1, we consider the sequence of polynomials equation* fm,n u(x)=Σi=0kn-1ζksk(i)(x+ u(i))m. equation* defined for sequences 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.