4 citations · 10 across the 7 of their papers we have counts for
4 papers · 1 filter
Aperiodicity and subword complexity in the binary expansion of powers of three
Ralf Stephan
We prove two results on the fine structure of the binary digits of . First, for every fixed period , the number of positions at which the binary expansion of brea…
Prove or Disprove. 100 Conjectures from the OEIS
Ralf Stephan
Presented here are over one hundred conjectures ranging from easy to difficult, from many mathematical fields. I also summarize briefly methods and tools that have led to this coll…
Divide-and-conquer generating functions. Part I. Elementary sequences
Ralf Stephan
Divide-and-conquer functions satisfy equations in F(z),F(z^2),F(z^4)... Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is…
On a sequence related to the Josephus problem
R. Stephan
In this short note, we show that an integer sequence defined on the minimum of differences between divisor complements of its partial products is connected with the Josephus proble…